/**
 * Code by Patrick Sava
 * "Spiru Haret" National College of Bucharest
 **/

# include "fstream"
# include "cstring"
# include "vector"
# include "queue"
# include "bitset"
# include "algorithm"
# include "map"
# include "set"
# include "unordered_map"
# include "deque"
# include "string"
# include "iomanip"
# include "cmath"
# include "stack"
# include "cassert"

const char IN [ ] =  "scmax.in" ;
const char OUT [ ] = "scmax.out" ;

using namespace std ;

# define pb push_back
# define mp make_pair
# define FORN( a , b , c ) for ( register int a = b ; a <= c ; ++ a )
# define FORNBACK( a , b , c ) for ( register int a = b ; a >= c ; -- a )

ifstream cin ( IN ) ;
ofstream cout ( OUT ) ;

const int MAX = 1e5 + 14 ;

int v [ MAX ] ;
int len [ MAX ] ;
int prevs [ MAX ] ;

stack < int > st ;

int main()
{
    int n ;
    cin >> n ;
    FORN ( i , 1 , n ){
        cin >> v [ i ] ;
        len [ i ] = n + 1 ;
    }
    v [ n + 1 ] = 2000000000 ;
    FORN ( i , 1 , n )
    {
        int st = 1 ;
        int dr = i ;
        int found = 1 ;
        while ( st <= dr )
        {
            int mij = ( st + dr ) >> 1 ;
            if ( v [ len [ mij ] ] >= v [ i ] ) {
                found = mij ;
                dr = mij - 1 ;
            }
            else {
                st = mij + 1 ;
            }
        }
        len [ found ] = i ;
        prevs [ i ] = len [ found - 1 ] ;
    }
    FORNBACK ( i , n , 1 ) {
        if ( len [ i ] <= n ) {
            cout << i << '\n' ;
            while ( len [ i ] ) {
                st.push ( v [ len [ i ] ] ) ;
                len [ i ] = prevs [ len [ i ] ] ;
            }
            while ( st.empty() == 0 ) {
                cout << st.top( ) << ' ' ;
                st.pop() ;
            }
            exit ( 0 ) ;
        }
    }
    return 0;
}