#include <fstream>
#include <iostream>
#include <vector>
#include <bitset>
#include <string.h>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <time.h>
#include <stdlib.h>
#include <set>
#include <map>
#include <string>
#include <queue>
#include <deque>

using namespace std;

const char infile[] = "scmax.in";
const char outfile[] = "scmax.out";

ifstream fin(infile);
ofstream fout(outfile);

const int MAXN = 100005;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

pair<int, int> v[MAXN];
int aib[MAXN], a[MAXN], Father[MAXN], dp[MAXN], s[MAXN];
int LiStart, N;

inline int lsb(int conf) {
    return conf & (-conf);
}

inline void Update(int pos, int value) {
    for(int i = pos ; i <= N ; i += lsb(i))
        //cerr << i << ' ';
        if(dp[ aib[i] ] < dp[value])
            aib[i] = value;
}

inline int Query(int pos) {
    int posMax = 0;
    for(int i = pos ; i > 0 ; i -= lsb(i))
        if(dp[aib[i]] > dp[posMax])
            posMax = aib[i];
    return posMax;
}

void Write(int Node) {
    if(Father[Node])
        Write(Father[Node]);
    fout << s[Node] << ' ';
}

int main() {
    fin >> N;
    for(int i = 1 ; i <= N ; ++ i) {
        fin >> s[i];
        v[i].first = s[i];
        v[i].second = i;
    }
    sort(v + 1, v + N + 1);
    v[0].first = -1;
    for(int i = 1 ; i <= N ; ++ i)
        a[ v[i].second ] = a[ v[i - 1].second ] + (v[i].first != v[i - 1].first);
    for(int i = 1 ; i <= N ; ++ i) {
        Father[i] = Query(a[i] - 1);
        dp[i] = 1 + dp[Father[i]];
        Update(a[i], i);
        //fout << dp[i] << ' ';
        if(dp[LiStart] < dp[i])
            LiStart = i;
    }
    fout << dp[LiStart] << '\n';
    Write(LiStart);
    fin.close();
    fout.close();
    return 0;
}