#include <fstream>
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, a[100001], dp[100001], poz[100001], maxi;
int main()
{
    f >> n;
    for (int i = 1; i <= n; ++i) f >> a[i];
    dp[1] = poz[1] = 1;
    for (int i = 2; i <= n; ++i) {
        dp[i] = 1;
        poz[i] = i;
        for (int j = 1; j < i; ++j) if (a[j] < a[i] && dp[j] + 1 > dp[i]) {
            dp[i] = dp[j] + 1;
            poz[i] = j;
        }
        maxi = max(maxi, dp[i]);
    }
    int i = n, k = 0;
    while (dp[i] - maxi) --i;
    g << dp[i] << endl;
    i = n;
    while (poz[i] == i) --i;
    n = a[i];
    while (poz[i] - i) {
        dp[++k] = a[poz[i]];
        i = poz[i];
    }
    for (i = k; i; --i) g << dp[i] << ' ';
    g << n << ' ';
    g << '\n';
    return 0;
}