#include <bits/stdc++.h>

using namespace std;

const int max_size = 1e5 + 20, INF = 2e9 + 20;

int poz[max_size], dp[max_size], v[max_size];

void solve ()
{
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> v[i];
        poz[i] = INF;
    }
    int mx = 0;
    for (int i = 1; i <= n; i++)
    {
        int e = 20, st = 0;
        while (e >= 0)
        {
            if (st + (1 << e) <= mx && poz[st + (1 << e)] < v[i])
            {
                st += (1 << e);
            }
            e--;
        }
        dp[i] = st + 1;
        poz[dp[i]] = min(poz[dp[i]], v[i]);
        mx = max(mx, dp[i]);
    }
    cout << mx << '\n';
    int ult;
    for (int i = n; i > 0; i--)
    {
        if (dp[i] == mx)
        {
            ult = v[i];
            break;
        }
    }
    mx--;
    vector <int> ans;
    ans.push_back(ult);
    for (int i = n; i > 0; i--)
    {
        if (dp[i] == mx && v[i] < ult)
        {
            ans.push_back(v[i]);
            ult = v[i];
            mx--;
        }
    }
    reverse(ans.begin(), ans.end());
    for (auto f : ans)
    {
        cout << f << " ";
    }
    cout << '\n';
}

signed main ()
{
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#else
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    long long tt;
    //cin >> tt;
    tt = 1;
    while (tt--)
    {
        solve();
    }
    return 0;
}