#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

#define NMAX 100007

int i,j,N,f,c,pos,step;
int aib[NMAX],dp[NMAX],t[NMAX],p[NMAX];
vector < int > q,sol;

int main()
{
freopen("scmax.in","r",stdin);
freopen("scmax.out","w",stdout);

scanf("%d",&N);

q.push_back(0);
for (i=1;i<=N;++i)
{
    scanf("%d",&t[i]);
    q.push_back(t[i]);
}

sort(q.begin(),q.end());
q.resize(distance(q.begin(),unique(q.begin(),q.end())));

for (i=1;i<=N;++i)
{
    for (step=1;step<(q.size()-1);step<<=1);
    for (j=0;step && !p[i];step>>=1)
    {
        if (q[j+step]==t[i]) p[i]=j+step;

        if (j+step<(q.size()-1) && q[j+step]<=t[i])
        j+=step;
    }

    for (pos=p[i]-1;pos;pos-=(pos&(-pos)))
    dp[i]=max(dp[i],aib[pos]);

    dp[i]++;

    for (pos=p[i];pos<=N;pos+=(pos&(-pos)))
    aib[pos]=max(aib[pos],dp[i]);

    if (dp[i]>c)
    {
        c=dp[i];
        f=i;
    }

    //printf("%d ",dp[i]);
}

sol.push_back(f);

for (i=f;i;--i)
if (dp[i]==dp[f]-1 && p[i]<p[f])
{
    sol.push_back(i);
    f=i;
}

for (printf("%d\n",sol.size()),i=sol.size()-1;i>=0;--i)
printf("%d ",t[sol[i]]);

return 0;
}