#include <fstream>
#include <algorithm>
using namespace std;
const int Vmax = 100001;
int a[Vmax];
int minVal[Vmax];
int pre[Vmax];
int dp[Vmax];
int lMax;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
void reconst(int last){
    if(pre[last])
        reconst(pre[last]);
    fout<<a[last]<<" ";
}
int main(){
    
    int n;
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>a[i];
    for(int i=1;i<=n;i++){
        if(minVal[lMax] < a[i]){
            lMax++;
            minVal[lMax] = a[i];
            dp[lMax] = i;
            if(lMax)
                pre[i] = dp[lMax-1];
        }
        else{
            int poz = lower_bound(minVal+1, minVal+lMax+1, a[i]) - minVal;
            minVal[poz] = a[i];
            dp[poz] = i;
            if(poz)
                pre[i] = dp[poz-1];
        }
    }
    fout<<lMax<<'\n';
    int curent = dp[lMax];
    reconst(curent);
    return 0;
}