#include <bits/stdc++.h>

using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int n, v[100100], k;
int dp[100100];
int p[100100];
int afisare[100100];
///dp[i] -> subsir maximal care are ca ultim element v[i], cu lungimea j
int main()
{
    fin >> n;
    for(int i = 1; i <= n; i ++)
        fin >> v[i];
    dp[++k] = v[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 st = 1, dr = k, poz = 0;
                while(st <= dr)
                {
                    int mijloc = (st+dr) / 2;
                    if(dp[mijloc] >= v[i])
                    {
                        poz = mijloc;
                        dr = mijloc - 1;
                    }
                    else
                        st = mijloc + 1;
                }
                dp[poz] = v[i];
                p[i] = poz;
        }
    }
    fout << k << '\n';
    int j = n;
    for(int i = k; i >= 1; i --)
    {
        while(p[j] != i)
            j--;
        afisare[i] = v[j];
    }
    for(int i = 1; i <= k; i ++)
        fout << afisare[i] << ' ';
}