#include <bits/stdc++.h>

using namespace std;

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

void usain_bolt()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
}

const int N = 1e5 + 5;

int a[N], sol[N], dad[N];

int bsearch(int k, int n)
{
    int left = 1, right = n, mx = 0;
    while(left <= right) {
        int mid = (left + right) >> 1;
        if(k > a[sol[mid]]) {
            left = mid + 1;
            mx = max(mx, mid);
        }
        else {
            right = mid - 1;
        }
    }
    return mx;
}

void path(int k)
{
    if(dad[k] == 0) {
        fout << a[k] << " ";
    }
    else {
        path(dad[k]);
        fout << a[k] << " ";
    }
}
int main()
{
    usain_bolt();

    int n, k = 0;

    fin >> n;
    for(int i = 1; i <= n; ++i) {
        fin >> a[i];
    }
    sol[++k] = 1;
    for(int i = 2; i <= n; ++i) {
        int pos = bsearch(a[i], k);
        sol[pos + 1] = i;
        dad[i] = sol[pos];
        k = max(k, pos + 1);
    }
    fout << k << "\n";
    path(sol[k]);
    return 0;
}