#include <cstdio>
#include <algorithm>
#define bins(x,maxpoz,vector) lower_bound(vector+1,vector+maxpoz,x)-vector
const int MAX = 100100;
const int inf = (1LL<<31)-1;
using namespace std;
int p[MAX],solve[MAX],v[MAX],sol;
void dothejob(int x,int poz);
int main()
{
    int n;
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;scanf("%d",v+i),++i);
    for(int i=1;i<=n;++i){
        solve[i]=inf;
        int aux=bins(v[i],i,solve);
        solve[aux]=v[i];p[i]=aux;
        sol=max(sol,aux);
    }
    printf("%d\n",sol);
    dothejob(sol,n);
    return 0;
}
void dothejob(int x,int poz)
{
    for(int i=x;i>=1;--i){
        while(p[poz]!=x)--poz;
        solve[x]=v[poz];
        --x;
    }
    for(int i=1;i<=sol;(i<=sol)?printf("%d ",solve[i]):0,++i);
}