#include <fstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <deque>
#include <string>
#include <unordered_map>
#include <vector>
#include <stack>
#include <deque>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");

int main()
{
    int n;
    cin >> n;

    vector<int> v(n + 1), poz(n + 1), pre(n + 1);
    vector<int> best;
    int lg=0;
    for(int i=1; i<= n; i++)
        cin >> v[i];
    for(int i=1; i<= n; i++)
    {
        int k=lower_bound(best.begin(), best.end(), v[i])- best.begin();
        if(k==lg)
        {
            best.push_back(v[i]);
            lg++;
        }
        else
            best[k]=v[i];
        poz[k+1]=i;
        if(k>0)
            pre[i]=poz[k];
        else
            pre[i]=0;
    }
    cout << lg << '\n';
    vector<int>sol;
    int p=poz[lg];
    while(p!=0)
    {
        sol.push_back(v[p]);
        p=pre[p];
    }
    reverse(sol.begin(), sol.end());
    for(int x:sol)
        cout << x << " ";

    return 0;
}