#include <fstream>
#include <stack>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
int n, k = 1;

struct
{
    int val, lg;
} a[100002];

void recon(int poz, int lug)
{
    stack<int> S;
    S.push(a[poz].val);
    lug--;
    for (int i = poz - 1; i >= 1; --i)
        if (a[i].lg == lug)
            lug--, S.push(a[i].val);

    while (!S.empty())
    {
        cout << S.top() << " ";
        S.pop();
    }
}

void sclm()
{
    int lgmax = 0, pozf;
    a[1].lg = 1;

    for (int i = 2; i <= n; ++i)
    {
        int lungime = 0;
        for (int j = 1; j < i; ++j)
        {
            if (a[j].val < a[i].val && lungime < a[j].lg)
                lungime = a[j].lg;
        }
        a[i].lg = lungime + 1;

        if (a[i].lg > lgmax)
            lgmax = a[i].lg, pozf = i;
    }

    cout << lgmax << '\n';
    recon(pozf, lgmax);
}

int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i].val;
    sclm();
    return 0;
}