#include<cstdio>
using namespace std;

const int NMAX = 100009;
int a[NMAX], best[NMAX], n, pre[NMAX], maxim, poz;

int main()
{
    freopen("scmax.in", "rt", stdin); freopen("scmax.out", "wt", stdout);

    scanf("%d", &n);
    for(int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    best[n] = 1;
    pre[n] = n + 1;
    for(int i = n - 1; i >= 1; --i)
    {
        if(a[i] < a[i + 1])
        {
            best[i] = best[i + 1] + 1;
            pre[i] = i + 1;
        }
        else
        if(a[i] == a[i + 1])
        {
            int j = i + 1;
            while(a[i] == a[j] && j <= n)
            {
                j++;
            }
            best[i] = best[j] + 1;
            pre[i] = j;
        }
        if(maxim < best[i]) maxim = best[i], poz = i;
    }

    printf("%d\n", maxim);
    for(int i = poz; i <= n; i = pre[i])
       printf("%d ", a[i]);

    return 0;
}