//#pragma optimization_level 3
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#include<bits/stdc++.h>
#include<algorithm>
#include<fstream>
#include<iostream>
#include<stdio.h>
#include<vector>
#include<stack>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>ordset;
*/

#define fr first
#define sc second
#define vec vector
#define pb push_back
#define pii pair<int, int>
#define fast cin.tie(0);cout.tie(0);cin.sync_with_stdio(0);cout.sync_with_stdio(0);

#define in fin
#define out fout

using namespace std;

typedef long long ll;
typedef unsigned int uint;
const int nmax = 300005;
const ll mod = 1e9+7;

int n;
int a[nmax], b[nmax], parent[nmax];
int c[nmax];
pii bitdp[nmax];
pii query(int pos){
    pii mx = {0,-1};
    for(int i = pos ; i > 0 ; i -= i&(-i)){
        if(mx.fr < bitdp[i].fr){
            mx = bitdp[i];
        }
    }
    return mx;
}
void update(int pos, int val , int index){
    for(int i = pos ; i <= n ; i += i&(-i)){
        if(bitdp[i].fr < val){
            bitdp[i].sc = index;
            bitdp[i].fr = val;
        }
    }
}

int main(){

    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);

    scanf("%d", &n);
    for(int i = 1; i <= n; i++){
        scanf("%d", &a[i]);
        c[i] = a[i];
    }
    sort(c+1,c+n+1);
    for(int i = 1; i <= n; i++){
        b[i] = lower_bound(c+1,c+n+1,a[i]) - c ;
    }
    for(int i = 1 ; i <= n; i++){
        pii mx = query(b[i]-1);
        parent[i] = mx.sc;
        update(b[i],mx.fr+1,i);
    }
    pii mx = query(n);
    int start = mx.sc;
    printf("%d\n", mx.fr);
    stack < int > rez;
    while(start != -1){
        rez.push(a[start]);
        start = parent[start];
    }
    while(!rez.empty()){
        printf("%d ", rez.top());
        rez.pop();
    }
    // dp[i] = max(dp[j] | j < i && a[j] < a[i])
}