#include <iostream>
#include <fstream>
#include <map>
#include <algorithm>
#include <vector>
#define MAX 100002
using namespace std;
int n,dp[MAX],aib[MAX],o[MAX],v[MAX],t[MAX];
map<int, int> mp;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

void update(int pos, int val, int x){
    /// x = pozitia in vectorul cu nr
    for(int i = pos; i <= n; i += (i&-i)){
        if(dp[aib[i]] < val){
            aib[i] = x;
        }
    }
}

int query(int pos){
    /// pozitia elementului maxim din secv [1, pos] din dp
    int ans = 0, maxi = 0;
    for(int i = pos; i > 0; i -= (i&-i)){
        if(dp[ans] < dp[aib[i]]){
            ans = aib[i];
            maxi = dp[aib[i]];
        }
    }
    return ans;
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> o[i];
        v[i] = o[i];
    }
    sort(o+1, o+n+1);
    for(int i = 1; i <= n; i++){
        mp[o[i]] = i;
    }
    for(int i = 1; i <= n; i++){
        v[i] = mp[v[i]];
    }
    for(int i = 1; i <= n; i++){
        t[i] = query(v[i]-1);
        dp[i] = 1+dp[t[i]];
        update(v[i], dp[i], i);
    }
    int maxi = 0, poz = 0;
    for(int i = 1; i <= n; i++){
        if(maxi < dp[i]){
            maxi = dp[i];
            poz = i;
        }
    }
    fout << maxi << "\n";
    vector<int> sol;
    while(poz != 0){
        sol.push_back(o[v[poz]]);
        poz = t[poz];
    }
    reverse(sol.begin(), sol.end());
    for(auto it: sol){
        fout << it << " ";
    }
    return 0;
}