#include <fstream>

using namespace std;

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

int n, v[100005], p[100005], m[100005], L, newL, s[100005];

int binarySearch(int i)
{
    int lo = 0, hi = L;
    while(lo <= hi)
    {
        int mid = (lo + hi) / 2;
        if (v[m[mid]] < v[i])
            lo = mid + 1;
        else
            hi = mid - 1;
    }
    return lo;
}
int main()
{
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> v[i];
    }
    for(int i = 1; i <= n; ++i)
    {
        newL = binarySearch(i);
        p[i] = m[newL - 1];
        m[newL] = i;
        if(newL > L)
            L = newL;
    }
    int k = m[L];
    for(int i = L; i >= 1; --i)
    {
        s[i] = v[k];
        k = p[k];
    }

    cout << L << '\n';
    for(int i = 1; i <= L; ++i)
        cout << s[i] << ' ';
    return 0;
}