#include <cstdio>
        #include <cstring>
        using namespace std;
        int a[100001], poz[100001], st[100001];

        void cautare (int n, int x, int &p)
        {
            int St=1, Dr=n, m; p=0;
            while (p==0 && St<=Dr)
            {
                m=(St+Dr)/2;
                if (st[m]==x) p = m;
                else
                {
                    if (st[m]>x) Dr = m-1;
                    else St = m+1;
                }
            }
            if (p==0) p = St;
        }

        int main()
        {
            int n, i, p, nr=0;
            bool ok;
            freopen("scmax.in","r",stdin);
            freopen("scmax.out","w",stdout);
            scanf("%d",&n);
            for (i=1; i<=n; i++) scanf("%d",&a[i]); memset(st,0,sizeof(a));
            st[1]= a[1]; nr=1; poz[1]=1;
            int Lmax = 1; int pz =1;
            for (i=2; i<=n; i++)
            {
                cautare(nr,a[i],p);
                if (p<=nr) st[p]=a[i];
                else st[++nr]=a[i];
                poz[i] = p;
                if(p>Lmax){Lmax=p; pz = i;}
            }
            printf("%d\n",nr);
            for (i=1; i<=nr; i++) printf("%d ",st[i]);
            fclose(stdin);
            fclose(stdout);
            return 0;
        }