#include <bits/stdc++.h>

/// lis[i]=capatul minim al unui subsir de lungime i
/// poz[i]=pozitia unde s-a inserat a[i] in vectorul lis

using namespace std;

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

const int nMax = 100005;
int n, a[nMax], lis[nMax], poz[nMax], k, ans[nMax];

inline void Read()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> a[i];
}

inline int BSearch(int x)
{
    int st, dr, m, p;
    st = 1;
    dr = k;
    while(st <= dr)
    {
        m = (st + dr) / 2;
        if(lis[m] < x)
            st = m + 1;
        else
        {
            p = m;
            dr = m - 1;
        }
    }
    return p;
}

inline void Solve()
{
    int x, p;
    lis[1] = a[1];
    poz[1] = k = 1;
    for(int i = 2; i <= n; i++)
    {
        x = a[i];
        if(x > lis[k])
        {
            lis[++k] = x;
            poz[i] = k;
        }
        else
        {
            p = BSearch(x);
            lis[p] = x;
            poz[i] = p;
        }
    }
    fout << k << "\n";
    for(int i = n; i && k; i--)
        if(poz[i] == k)
            ans[k--] = a[i];
    while(ans[++k])
        fout << ans[k] << " ";
}

int main()
{
    Read();
    Solve();
    fin.close();fout.close();
    return 0;
}