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

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

int n, numbers[100005];
vector<int> s;

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> numbers[i];
    // Folosim functia lower_bound pentru a gasi pozitia in vectorul s pe care ar trebui sa o ocupe i.
    for (int i = 1; i <= n; i++)
    {
        auto it = lower_bound(s.begin(), s.end(), numbers[i]);
        if (it == s.end())
            s.push_back(numbers[i]);
        else
            *it = numbers[i];
    }
    fout << s.size() << "\n";
    for (int i = s.size() - 1; i >= 0; i--)
        fout << s[i] << " ";
    fout << "\n";
    return 0;
}