#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[N - 1];
    while(st <= dr) {
        int mid = (st + dr) >> 1;
        if(k > a[f[mid]]) sol = max(sol, mid), st = mid + 1;
        else dr = mid - 1;
    }
    return sol;
}

void path(int k)
{
    if(dad[k]) path(dad[k]);
    fout << a[k] << " ";
}
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[N - 1]] = 1;
    for(int i = 2; i <= n; ++i) {
        int pos = bs(a[i]);
        dad[i] = f[pos];
        f[pos + 1] = i;
        f[N - 1] = max(f[N - 1], pos + 1);
    }
    fout << f[N - 1] << "\n";
    path(f[f[N - 1]]);
    return 0;
}