#include <cstdio>
#define N 100000

using namespace std;
int a[N];
int s1[2*N];
int s2[2*N];
int s1Length;
int s2Length;
int n;
int cautare(int x)
{
    int poz = -1;
    int min = 2000001;
        for(int i = 0 ; i < s1Length;i++)
        {
            if(s1[i] >= x && min > s1[i])
            {
                poz = i;
                min = s1[i];
            }
        }
    return poz;
}

void solve()
{

    for(int i = 0; i < n;i++)
    {
        int k = cautare(a[i]);
        if(k == -1)
        {
            s1[s1Length++] = a[i];
            s2[s2Length++] = s1Length-1;
        }
        else
        {
            s1[k] = a[i];
            s2[s2Length++] = k;
        }
    }
}

void afis()
{
    int poz = s1Length -1;
    printf("%d\n",poz+1);
    int q = 0;
    for(int i = s2Length-1; i >= 0; i--)
    {
        if(s2[i] == poz)
        {
            s1[q++] = a[i]; // putea sa fie orice alt sir aici, dar nu mai e nevoie de s1 si are memorie alocata deja
            poz--;
        }
    }
    for(int i = q-1; i >=0 ;i--)
    {
        printf("%d ",s1[i]);
    }

}

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

    scanf("%d",&n);
    for(int i = 0 ; i < n ; i++)
    {
        scanf("%d",&a[i]);
    }
    solve();
    afis();

    return 0;
}