#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define mod 1000000007
#define fi first
#define se second
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, v[100002];
int len[100002], arr[100002];
int mx, wh;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    // shuffle(permutation.begin(), permutation.end(), rng);
    f>>n;
    for(int i=1; i<=n; ++i)
        f>>v[i];
    len[1]=1;
    int mx = 1;
    arr[1] = v[1];
    for(int i=2; i<=n; ++i)
    {
        int b = 1;
        int e = mx;
        while(b<=e)
        {
            int mid = (b+e)/2;
            if(v[i]>arr[mid])
                b = mid + 1;
            else
                e = mid - 1;
        }
        if(b == mx+1)
            ++mx;
        arr[b] = v[i];
        len[i] = b;
    }
    g<<mx<<'\n';
    vector<int>sol;
    int prev=2000000001;
    for(int i=n; i>=1; --i)
        if(len[i]==mx && v[i]<prev)
        {
            sol.push_back(v[i]);
            prev=v[i];
            --mx;
        }
    reverse(sol.begin(), sol.end());
    for(int i=0; i<sol.size(); ++i)
        g<<sol[i]<<" ";
    return 0;
}