#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin ("scmax.in");
ofstream cout ("scmax.out");
struct ura{
    int val, ind;
};
ura v[100005];
int seg[100005], n, rez[100005];
bool cmp(ura a, ura b)
{
    if (a.val != b.val)
        return a.val < b.val;
    return a.ind < b.ind;
}
void update(int nod, int x, int y, int key, int poz)
{
    if (x == y)
        seg[nod] = key;
    else
    {
int        mid = (x + y) / 2;
        if (poz <= mid)
            update(2 * nod, x, mid, key, poz);
        else
            update(2 * nod + 1, mid + 1, y, key, poz);
        seg[nod] = max(seg[nod * 2], seg[2 * nod + 1]);
    }
}
int query(int nod, int x, int y, int l, int r)
{
    if (l <= x && y <= r)
        return seg[nod];
    int mid = (x + y) / 2, maxi = 0;
    if (mid >= l)
        maxi = max(maxi, query(2 * nod, x, mid, l, r));
    if (mid < r)
        maxi = max(maxi, query(2 * nod + 1, mid + 1, y, l, r));
    return maxi;

}
int main()
{
    int i, j;
    cin >> n;
    for (i = 1; i <= n; i++)
    {
        cin >> v[i].val;
        v[i].ind = i;
    }
    sort (v + 1, v + n + 1, cmp);
    for (i = 1; i <= n; i++)
    {
        j = i;
        while (v[j].val == v[i].val && j <= n)
            j++;
        j--;
        int k = j;
        while (j >= i)
        {
            int d;
            if (1 < v[j].ind)
                d = query(1, 1, n, 1, v[j].ind - 1) + 1;
            else
                d = 1;
            update(1, 1, n, d, v[j].ind);
            j--;
        }
        i = k;
    }
    int sol = query(1, 1, n, 1, n);
    cout << sol << '\n';
    j = n;
    while (query(1, 1, n, v[j].ind, v[j].ind) != sol)
        j--;
    int k = 0;
    rez[++k] = v[j].val;
    int t = v[j].val;
    for (i = j - 1; i; i--)
    {
        if (v[i].val < t)
        {
            int tt = query(1, 1, n, v[i].ind, v[i].ind);
            if (tt + 1 == sol)
            {
                rez[++k] = t = v[i].val;
                sol--;
            }
        }
    }
    while (k)
        cout << rez[k--]<< " ";
    return 0;
}