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

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

vector<vector<int>> subSiruri;

void Inserare(int x, vector<vector<int>>& vecSubSiruri);

int main()
{
    int m, x;
    fin >> m;
    for (int i = 1; i <= m; ++i)
    { fin >> x; Inserare(x, subSiruri); }

    fout << subSiruri.size() << '\n';
    int elem = subSiruri.back().back();
    stack<int> S;
    S.push(elem);

    for (size_t i = subSiruri.size() - 2; i != UINT_MAX; --i)
    {
        for (size_t j = 0; j < subSiruri[i].size(); ++j)
        {
            if (subSiruri[i][j] < elem)
            {
                elem = subSiruri[i][j];
                S.push(elem);
                break;
            }
        }
    }

    while (!S.empty())
    {
        fout << S.top() << ' ';
        S.pop();
    }

    fin.close();
    fout.close();
    return 0;
}

void Inserare(int x, vector<vector<int>>& vecSubSiruri)
{
    if (vecSubSiruri.empty()) { vecSubSiruri.push_back({ x }); return; }
    if (x > vecSubSiruri.back().back()) { vecSubSiruri.push_back({ x }); return; }

    int st = 0, dr = vecSubSiruri.size() - 1, mij, aux;

    while (st <= dr)
    {
        mij = (st + dr) / 2;
        if (x <= vecSubSiruri[mij].back()) { aux = mij; dr = mij - 1; }
        else { st = mij + 1; }
    }

    subSiruri[aux].push_back(x);
}