#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 100000

using namespace std;

ifstream f("scmax.in");
ofstream g("scmax.out");

int n, v[NMAX+10], dp[NMAX+10], p[NMAX+10], k;
vector <int> sol;

int binSearch(int val)
{   int st = 1, dr = k;
    while(st <= dr)
        {   int mij = (st + dr) / 2;
            if(val > dp[mij]) st = mij + 1;
            else dr = mij - 1;
        }
    return st;
}

int main()
{
    f >> n;
    for(int i=1; i<=n; i++) f >> v[i];
    dp[1] = v[1];
    k = 1;
    p[1] = 1;
    for(int i=2; i<=n; i++)
        {   if(v[i] > dp[k]) dp[++k] = v[i], p[i] = k;
            else
                {   int poz = binSearch(v[i]);
                    dp[poz] = v[i];
                    p[i] = poz;
                }
        }
    g << k << '\n';
    int poz=k;
    for(int i=n; i; i--) if(p[i] == poz) sol.push_back(v[i]), poz--;
    for(int i=sol.size()-1; i>=0; i--) g << sol[i] << ' ';
    g << '\n';
    return 0;
}