//
//  main.cpp
//  scmax
//
//  Created by Darius Buhai on 10/11/2018.
//  Copyright © 2018 Darius Buhai. All rights reserved.
//

/*
 
 5|24 12 15 15 19
 1 3 2 2 1
 
 dp[i] = dp[i+1]
 maximul de la j la n
 
 ex2:
 7 10 9 4 12 9 11 4 49 2 15
 4 5  3 4 2  3  2 1  1 2  1
 
*/

#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n, x, maxi;
vector<int> sec, p;

int main() {
    fin>>n;
    for(int i=0;i<n;i++)
    {
        fin>>x;
        while(!sec.empty() && x<=sec.back())
            sec.pop_back();
        sec.push_back(x);
        p.push_back((int)sec.size());
        if(p.back()>maxi)
            maxi = p.back();
    }
    fout<<maxi<<endl;
    for(int i=0;i<sec.size();i++)
        fout<<sec[i]<<" ";
    return 0;
}