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

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

const int NMAX = 100000;

int n;
int dp[NMAX + 1];
int v[NMAX + 1];
int pos[NMAX + 1];
int ans[NMAX + 1];

int main()
{
    fin >> n;

    if (n == 0)
    {
        fout << 0 << '\n';
        return 0;
    }

    for (int i = 1; i <= n; i++)
    {
        fin >> v[i];
        pos[i] = 0;
    }

    dp[1] = v[1];
    int len = 1;

    for (int i = 2; i <= n; i++)
    {
        if (v[i] > dp[len])
            dp[++len] = v[i],pos[i] = len;
        else
        {
            int ind = lower_bound(dp + 1, dp + 1 + len, v[i]) - dp;
            dp[ind] = v[i];
            pos[i] = ind;
        }
    }

    fout << len << '\n';
    int cpLen = len;

    for (int i = n; i >= 1; i--)
        if (pos[i] == len)
            ans[len--] = v[i];

    for (int i = 1; i <= cpLen; i++)
    {
        fout << ans[i] << ' ';
    }

    return 0;
}