#include <bits/stdc++.h>

using namespace std;

ifstream fin ("scmax.in");
ofstream fout ("scmax.out");

const int N = 100005;

int a[N], best[N], dad[N], f[N];

int bs(int k)
{
    int sol = 0;
    int st = 1, dr = f[0];
    while(st <= dr) {
        int mid = (st + dr) >> 1;
        if(k > f[mid]) sol = max(sol, mid), st = mid + 1;
        else dr = mid - 1;
    }
    return sol;
}

int main()
{
    ios::sync_with_stdio(false);
    fin.tie(0);

    int n;

    fin >> n;
    for(int i = 1; i <= n; ++i) fin >> a[i];

    f[++f[0]] = a[1];
    for(int i = 2; i <= n; ++i) {
        int pos = bs(a[i]);
        f[pos + 1] = a[i];
        f[0] = max(pos + 1, f[0]);
    }
    fout << f[0] << "\n";
    for(int i = 1; i <= f[0]; ++i) fout << f[i] << " ";
    return 0;
}