#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>

#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <deque>
#include <queue>
#include <stack>

using namespace std;

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

typedef long long ll;

void Solve() {
    int n, last;
    fin >> n;
    vector<int> v(n), prev(n), s, p, ans;
    vector<pair<int, int>> c;
    for (int i = 0; i < n; ++i) {
        fin >> v[i];
    }

    for (int i = 0; i < n; ++i) {
        int pos = lower_bound(s.begin(), s.end(), v[i]) - s.begin();
        if (pos == s.size()) {
            last = i;
            s.push_back(v[i]);
            p.push_back(i);
        }
        else {
            s[pos] = v[i];
            p[pos] = i;
        }

        --pos;
        prev[i] = pos >= 0 ? p[pos] : -1;
    }

    while (last != -1) {
        ans.push_back(v[last]);
        last = prev[last];
    }
    reverse(ans.begin(), ans.end());

    fout << ans.size() << '\n';
    for (int i = 0; i < ans.size(); ++i) {
        fout << ans[i] << ' ';
    }
    fout << '\n';
}

int main() {

    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    Solve();
    return 0;
}