#include <bits/stdc++.h>
using namespace std;

const int MAX = 100005;
int a[MAX], d[MAX], p[MAX], b[MAX], k;

int caut(int x)
{
    int left = 1, right = k, ans = k+1;
    while (left <= right)
    {
        int middle = left + (right - left) / 2;
        if (d[middle] > x)
        {
            ans = middle;
            right = middle - 1;
        }
        else
            left = middle + 1;
    }
    return ans;
}

int main()
{
    ifstream cin("scmax.in");
    ofstream cout("scmax.out");
    int n;
    cin >> n;
    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    d[1] = a[1];
    k = 1;
    p[k] = 1;
    for (int i = 2; i <= n; ++i)
    {
        if (a[i] > d[k])
        {
            d[++k] = a[i];
            p[i] = k;
        }
        else
        {
            int pos = caut(a[i]);
            d[pos] = a[i];
            p[i] = pos;
        }
    }

    int j = n;
    for (int i = k; i >= 1; --i)
    {
        while (p[j] != i)
            --j;
        b[i] = j;
    }

    cout << k << "\n";
    for (int i = 1; i <= k; ++i)
        cout << a[b[i]] << " ";

    return 0;
}