#include <fstream>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <string.h>
#include <queue>
#include <math.h>
#include <set>
#include <stack>

#define min(a,b) ((a<b)?a:b)
#define max(a,b) ((a<b)?b:a)
#define abs(a) ((a<0)?-a:a)
#define REP(i,a,b) \
	for (int i=a; i<=b; i++)

#define INF 10000000000001

using namespace std;

//#define TEST
#ifdef TEST
ifstream fin("input.txt");
ofstream fout("output.txt");
#else
ifstream fin("scmax.in");
ofstream fout("scmax.out");
#endif // TEST

#define MAXN 2000000001
#define pb push_back
#define mp make_pair
#define MOD 1000000007

typedef long long ll;
typedef pair<int,int> pp;

int n;
int a[100000];

multiset<int> s;

int main()
{
    fin>>n;
    for (int i=0; i<n; i++)
    {
        fin>>a[i];
    }

    for(int i=0; i<n; i++)
    {
        s.insert(a[i]);
        auto it = s.upper_bound(a[i]);
        if (it != s.end())
            s.erase(it);
    }

    fout<<s.size()<<'\n';
    while (s.size())
    {
        int x;
        x = *(s.begin());
        fout<<x<<' ';
        s.erase(s.begin());
    }


	return 0;
}