#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

std::vector<int> longest_increasing_subseq(const std::vector<int>& seq) {
    int numbers_count = seq.size();
    vector<int> sub;
    vector<int> sub_indexes;
    vector<int> trace(numbers_count, -1);
    for (int i = 0; i < numbers_count; ++i) {
        if (sub.empty() || sub[sub.size() - 1] < seq[i]) {
            if (!sub.empty())
                trace[i] = sub_indexes[sub.size() - 1];
            sub.push_back(seq[i]);
            sub_indexes.push_back(i);
        } else {
            int idx = lower_bound(sub.begin(), sub.end(), seq[i]) - sub.begin();
            if (idx > 0)
                trace[i] = sub_indexes[idx - 1];
            sub[idx] = seq[i];
            sub_indexes[idx] = i;
        }
    }

    vector<int> path;
    int idx = sub_indexes[sub_indexes.size() - 1];

    while (idx != -1) {
        path.push_back(seq[idx]);
        idx = trace[idx];
    }
    reverse(path.begin(), path.end());
    return path;
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::size_t n;
    cin >> n;
    std::vector<int> seq(n);

    for (auto& el : seq) {
        std::cin >> el;
    }

    auto longest_seq = longest_increasing_subseq(seq);

    std::cout << longest_seq.size() << "\n";
    for (auto el : longest_seq) {
        std::cout << el << " ";
    }

    return 0;
}