#include <cstdio>
#include <vector>

using namespace std;

int n;
int sir[100005];
int dp[100005];
int dpx[100005];

vector<int> sol;

void citire(){
    scanf("%d", &n);

    for(int i = 1; i <= n; i++){
        scanf("%d", &sir[i]);
    }
}

void solve(){
    dp[1] = 1;
    dpx[1] = 0;

    for(int i = 2; i <= n; i++){
        int poz = i - 1;

        while(sir[poz] >= sir[i] && poz > 0){
            poz = dpx[poz];
        }

        dp[i] = dp[poz] + 1;
        dpx[i] = poz;
    }

    printf("%d\n", dp[n]);

    int poz = n;

    while(poz > 0){
        sol.push_back(poz);
        poz = dpx[poz];
    }

    for(int i = sol.size() - 1; i >= 0; i--){
        printf("%d ", sir[sol[i]]);
    }
}

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

    citire();
    solve();

    return 0;
}