#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

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

const int MAXN = 100000;
int n, k, a[MAXN+3], s[MAXN+3], pos[MAXN+3];

/*int cautBin(int x, int lo = 0, int hi = k)
{
    if(hi <= lo) return 0;
    int mid = lo + (hi-lo)/2;
    if(s[mid] >= x && s[mid-1] < x) return mid;
    if(s[mid] > x) return cautBin(x, mid+1, hi);
    if(s[mid] <= x) return cautBin(x, lo, mid);
}*/

vector<int>sol;

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> a[i];
    for(int i = 1; i <= n; i++)
    {
        if(k == 0 || s[k] < a[i])
        {
            s[++k] = a[i];
            pos[k] = i;
        }
        else
        {
            int posElem = upper_bound(s+1, s+k+1, a[i])-s;
            s[posElem] = a[i];
            pos[i] = posElem;
        }
    }
    fout << k << "\n";
    for(int i = n; i; i--)
        if(pos[i] == k)
        {
            sol.push_back(a[i]);
            k--;
        }
    for(int i = sol.size()-1; i >= 0; i--)
        fout << sol[i] << " ";
    return 0;
}