#include <bits/stdc++.h>
#define for0(i,n) for(int i=0; i<n; i++)
#define for1(i,n) for(int i=1; i<=n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define clr(A,x) memset(A, x, sizeof(A))
#define cpy(A,B) memcpy(A, B, sizeof(B))
#define g(s) getline(cin, s) ///ai grija la fin/cin ///
#define FASTIO ios_base::sync_with_stdio(0)
const long long INFLL = (1LL<<62);
const int INFINT = 2000000000;
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
/*template <typename T>
string to_string(const T& n){
    ostringstream os;
    os << n;
    return os.str();
}
*/

/*struct coord
{
    int x,y;

};
bool operator<(const coord &l, const coord &r)
{
    return (l.x<r.x || (l.x==r.x && l.y<r.y));
}*/

/*void invers_modular(int a, int b, int& d, int& x, int & y)
{
    if(!b)
    {
        d=a;
        x=1;
        y=0;
        return ;
    }2
    int x0, y0;
    invers_modular(b, a%b, d, x0, y0);
    x=y0;
    y=x0-a/b*y0;
} // daca x<0 se aduna cu mod pana e mai mare, x fiind rezultatul*/

/*ull p(int baze, int exponent)
{
    if(exponent==0)
        return 1;

    if(exponent%2==0)
        return p(baze*baze, exponent/2);
    else return baze*p(baze, exponent-1);
}*/
ifstream fin("scmax.in"); /// modifica cu numele corespunzator
ofstream fout("scmax.out"); /// modifica cu numele corespunzator

const int NMAX = 100001;

int n;
unordered_map<int, int> arbore;
V sequence;
V v;
int len[NMAX];


int caut(int x)
{
    int l = 0, r = sequence.size() - 1, m;
    while(l <= r)
    {
        m = (l + r) / 2;
        if(x > v[sequence[m]])
            l = m + 1;
        else r = m - 1;
    }
    return l;
}

int main()
{
    fin>>n;
    for0(i, n)
        arbore[i] =  -1;

    for0(i, n)
    {
        int a;
        fin>>a;
        v.pb(a);
        if(sequence.empty() || a > v[sequence.back()])
        {
            sequence.pb(i);
            if(sequence.size() > 1)
                arbore[i] = sequence[sequence.size() - 2];
        }
        else
        {
            int aux = caut(a);
            sequence[aux] = i;
            if(aux > 0)
                arbore[i] = sequence[aux - 1];
        }
    }

    for(int i = v.size() - 1; i >= 0; i--)
        if(arbore[i] != -1)
            len[arbore[i]] = max(len[i] + 1, len[arbore[i]]);
    int sol = 0;
    int poz = -1;
    for0(i, n)
    {
        if(len[i] + 1 > sol)
        {
            sol = len[i] + 1;
            poz = i;
        }
    }
    fout<<sol<<'\n';
    fout<<v[poz]<<' ';
    sol -= 2;
    for(int i = poz + 1; i < n; i++)
    {
        if(len[i] == sol && arbore[i] == poz)
        {
            poz = i;
            sol--;
            fout<<v[i]<<' ';
        }
    }

    return 0;
}