#include <bits/stdc++.h>

using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, v[100003];

int main()
{
    fin >> n;
    vector<int> lis, lis_index, last(n + 1, -1);
    for(int i=1; i<=n; i++) {
        fin >> v[i];
        if(lis.empty() || v[i] > lis.back()) {
            last[i] = (lis_index.empty() ? -1 : lis_index.back());
            lis.push_back(v[i]), lis_index.push_back(i);
        }
        else {
            int poz = lower_bound(lis.begin(), lis.end(), v[i]) - lis.begin();
            last[i] = (poz > 0 ? lis_index[poz - 1] : -1);
            lis[poz] = v[i], lis_index[poz] = i;
        }
    }
    fout << lis.size() << '\n';
    vector<int> sol;
    int curent = lis_index.back();
    while(curent != -1) {
        sol.push_back(curent);
        curent = last[curent];
    }
    reverse(sol.begin(), sol.end());
    for(int i : sol) fout << v[i] << " ";

    return 0;
}