# include <cstdio>
# include <algorithm>
using namespace std;
const int nmax=100005;
const int infi=1<<30;
int S[nmax],V[nmax],s[nmax],v[nmax];
int main(void)
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    int n;
    scanf("%d\n",&n);
    for (int i=1;i<=n;++i) scanf("%d",S+i);
    int MAX=0;
    for (int i=1;i<=n;++i)
    {
        V[i]=infi;
        int low=lower_bound(V+1,V+1+i,S[i])-V;
        V[low]=S[i];
        s[i]=low;
        if (low>MAX) MAX=low;
    }
    printf("%d\n",MAX);
    for (int i=n,j=MAX;i && j;--i)
        if (s[i]==j)
           v[j]=S[i],--j;
    for (int i=1;i<=MAX;++i) printf("%d ",v+i);
    printf("\n");
    return 0;
}