#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n, lung = 1, pozmax = 1, poz;
vector <int> v, dp, pozi, rez;
int binserch(int x)
{
    int st = 1, dr = lung;
    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        if(v[dp[mij]] >= x)
            dr = mij - 1;
        else
            st = mij + 1;
    }
    return st;
}
int main()
{
    cin >> n;
    v.resize(n+1);
    dp.resize(n+1);
    pozi.resize(n+1);
    for(int i=1; i<=n; i++)
        cin >> v[i];
    dp[1] = 1;
    pozi[1] = 0;
    for(int i=2; i<=n; i++)
    {
        if(v[dp[lung]] < v[i])
        {
            dp[++lung] = i;
            pozi[dp[lung]] = dp[lung - 1];
        }
        else
        {
            poz = binserch(v[i]);
            dp[poz] = i;
            pozi[dp[poz]] = dp[poz - 1];
        }
    }
    cout << lung << '\n';
    for( int i = dp[lung]; i; i = pozi[i])
        rez.push_back(v[i]);
    reverse(rez.begin(), rez.end());
    for(auto i : rez)
        cout << i << " ";
    return 0;
}