#include <bits/stdc++.h>

#define NMax 100005
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[NMax],d[NMax],t[NMax];
int len;
int l, r;

void Read()
{
    f>>n;
    for(int i = 1;i <= n;++i)
        f>>v[i];
}

void reconstituie(int ind)
{
    if(t[ind])
        reconstituie(t[ind]);
    g<<v[ind]<<" ";
}

void Solve()
{
    len = d[1] = 1;
    for(int i = 2;i <= n;++i)
    {
        l = 1;
        r = len;

        while(l <= r)
        {
            int m = l + (r - l) / 2;

            if(v[d[m]] >= v[i])
                r = m - 1;
            else
                l = m + 1;
        }

        int pos = l;

        if(pos > len)
        {
            ++len;
            d[len] = i;
            t[d[len]] = d[pos - 1];
        }
        else
        {
            d[pos] = i;
            t[d[pos]] = d[pos - 1];
        }
    }
    g<<len<<'\n';
    reconstituie(d[len]);
    g.close();
    f.close();
}

int main()
{
    Read();
    Solve();
    return 0;
}