#include <cstdio>

using namespace std;
int n, a[100001], dp[100001];

int maxi(int i)
{
    int vmax=0;
    for(int j=i+1; j<=n; j++)
        if(a[j] > a[i] && dp[j] > vmax)
            vmax = dp[j];
    return vmax;
}

int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
        scanf("%d", &a[i]);
    dp[n] = 1;
    int vm=0;
    for(int i=n-1; i>=1; i--)
    {
        dp[i] = 1+maxi(i);
        if(dp[i] > dp[vm])
            vm = i;
    }
    printf("%d\n%d ", dp[vm], a[vm]);
    int aux=dp[vm];
    for(int i=vm-1; i<=n; i++)
    {
        if(dp[i] == aux-1)
        {
            printf("%d ", a[i]);
            aux--;
        }
    }
    return 0;
}