#include <fstream>
#include <set>
#include <stack>
#define nmax 100004
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n,v[nmax],p[nmax],q[nmax],len,sp,k[nmax];
stack <int> s;
int bs (int val)
{
    int low=1,hi=len;
    while (low<hi)
    {
        int mid=(low+hi)/2;
        if (q[mid]<val) low=mid+1;
        else hi=mid;
    }
    if (q[low]>val && q[low-1]<=val) return low;
    return -1;
}
int main()
{
    f>>n;
    for (int i=1;i<=n;i++) f>>v[i];
    p[1]=len=1;
    q[1]=v[1];
    k[1]=1;
    for (int i=2;i<=n;i++)
    {
        int pos=bs(v[i]);
        if (pos==-1)
        {
            len++;
            q[len]=v[i];
            p[i]=len;
        }
        else
        {
            q[pos]=v[i];
            p[i]=pos;
        }
    }
    g<<len<<'\n';
    for (int i=n;i>=1;i--)
        if (p[i]==len)
        {
            s.push(v[i]);
            len--;
        }
    while (!s.empty())
    {
        g<<s.top()<<' ';
        s.pop();
    }
    f.close();
    g.close();
    return 0;
}