#include <fstream>
#include <string.h>
#include <vector>
#include <algorithm>

using namespace std;

ifstream cin ("scmax.in");
ofstream cout ("scmax.out");

const int N = 1e5;
int a[N + 1];

vector <int> v, poz, sol;

int n, len;

int main()
{
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];
    v.push_back(a[1]);
    poz.push_back(0);
    for (int i = 2; i <= n; ++i)
    {
        vector <int> :: iterator it = lower_bound(v.begin(), v.end(), a[i]);
        int pos = it - v.begin();
        if (it == v.end())
           v.push_back(a[i]);
        else
            *it = a[i];
        poz.push_back(pos);
    }
    cout << v.size() << '\n';
    int len = v.size() - 1;
    for (int i = poz.size() - 1; i >= 0 && len >= 0; --i)
    {
        if (poz[i] != len)
            continue;
        sol.push_back(i + 1);
        len--;
    }
    reverse (sol.begin(), sol.end());
    for (auto it : sol)
        cout << a[it] << ' ';
    return 0;
}