#include <bits/stdc++.h>
#define dz(x) ((x^(x-1))&x)
#define nmax 100002
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
typedef int vect[nmax];
vect aib, dp, a, v, sol;
int n;
int lg;
int i;
int poz;
void update(int x, int ind)
{
    for(; x <= n ; x += dz(x))
        if(dp[ind] > dp[aib[x]])
            aib[x] = ind;
}
int query(int x)
{
    int ind=0;
    for(; x; x -= dz(x))
        if(dp[aib[x]] > dp[ind])
            ind = aib[x];
    return ind;
}
void afis(int poz)
{
    int i;
    for(i=poz;i>=1;i--)
        if(dp[i]==dp[poz]-1 && a[i]<a[poz])
    {
        afis(i);
        fout<<sol[i]<<" ";
        return;
    }
}
int main()
{
    fin>>n;
    for(i = 1; i <= n; i++)
        fin >> a[i], sol[i]=v[i]=a[i];
    sort(v+1,v+n+1);
    for(i=1;i<=n;i++)
        if(v[lg]!=v[i])
            v[++lg]=v[i];
    for(i=1;i<=n;i++)
        a[i]=lower_bound(v+1,v+lg+1,a[i])-v;
    for(i=1;i<=n;i++)
    {
        dp[i]=1+dp[query(a[i]-1)];
        if(dp[poz]<dp[i])
            poz=i;
        update(a[i],i);
    }
    fout<<dp[poz]<<"\n";
    afis(poz);
    fout<<sol[poz]<<" ";
    return 0;
}