#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f("scmax.in");
ofstream g("scmax.out");

int n , k;
int v[100001] , dp[100001] , p[100001];
vector < int > ans;

int binarySearch(int k , int x){
    int left = 1 , right = k , poz = 0;
    while(left <= right){
        int m = (left + right) / 2;
        if(x > dp[m])
            left = m + 1;
        else
            right = m - 1 , poz = m;
    }
    return poz;
}

void sclm(){
    for(int i = 1 ; i <= n ; ++i){
        if(v[i] > dp[k])
            dp[++k] = v[i] , p[i] = k;
        else{
            int poz = binarySearch(k , v[i]);
            dp[poz] = v[i] , p[i] = poz;
        }
    }
    int j = n;
    for(int i = k ; i >= 1 ; --i){
        while(p[j] != i)
            --j;
        ans.push_back(j);
    }
    g << k << "\n";
    for(int i = ans.size() - 1 ; i >= 0 ; --i)
        g << v[ans[i]] << " ";
}

int main()
{
    f >> n;
    for(int i = 1 ; i <= n ; ++i)
        f >> v[i];
    sclm();
    return 0;
}