#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 1000000
#define pb push_back
#define mp make_pair
#define MOD 1000000007

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

int n;
int a[100001];
int b[100001];
int m=0;

int main()
{
    fin>>n;

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

    b[0]=-1;
    b[1] = a[0];

    for (int i=1; i<n; i++)
    {
        int k;
        k = lower_bound(b+1,b+n+1,a[i]) - b;
        k--;
        b[k+1] = min(b[k+1],a[i]);
    }

    for (int i=0; i<=n; i++)
        if (b[i]<2000000000) m=i;

    fout<<m;
    fout<<'\n';
    for (int i=1; i<=m; i++)
        fout<<b[i]<<' ';

	return 0;
}