#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define a first
#define b second
#define mp make_pair

using namespace std;

vector<pair<int, int>> v, aib;
vector<int> p, ov, sol;
int n;

int lsb(int x)
{
    return ((x&(x-1))^x);
}

void update(int pos, int nr, int nrpos)
{
    while(pos <= n)
    {
        if(aib[pos].a < nr)
        {
            aib[pos].a = nr;
            aib[pos].b = nrpos;
        }

        pos += lsb(pos);
    }
}

pair<int, int> querry(int pos)
{
    int m = 0, mpos = 0;

    while(pos > 0)
    {
        if(m < aib[pos].a)
        {
            m = aib[pos].a;
            mpos = aib[pos].b;
        }

        pos -= lsb(pos);
    }

    return mp(m, mpos);
}

int main()
{
    ifstream f("scmax.in");
    ofstream g("scmax.out");

    f >> n;

    v.resize(n);
    aib.resize(n+1);
    p.resize(n+1);
    ov.resize(n+1);

    for(int i = 0; i < n; ++i)
    {
        f >> v[i].a;
        v[i].b = -i-1;
        ov[i+1] = v[i].a;
    }

    sort(v.begin(), v.end());

    int m = 0, mpos = 0;

    for(int i = 0; i < n; ++i)
    {
        pair<int, int> q = querry(-v[i].b);

        if(m < q.a+1)
        {
            m = q.a+1;
            mpos = -v[i].b;
        }
        p[-v[i].b] = q.b;

        update(-v[i].b, q.a+1, -v[i].b);
    }

    int rec = mpos;
    g << m << '\n';
    for(int i = 1; i <= m; ++i)
    {
        sol.push_back(ov[rec]);
        rec = p[rec];
    }

    for(int i = m; i; --i)
        g << sol[i-1] << ' ';
}