//
//  main.cpp
//  Subsir crescator maximal (infoarena)
//
//  Created by Andrei Bădulescu on 18.01.23.
//

//#include <iostream>
#include <fstream>

using namespace std;

ifstream cin("scmax.in");
ofstream cout("scmax.out");

const int N = 100000;

int length[N + 1];
int minValue[N + 1];

int numbers[N + 1];
int n, maxL, finale;

void resultFinder(int pos, int remainingL, int lastValue) {
    if (!remainingL) {
        return;
    }

    if (length[pos] == remainingL && numbers[pos] < lastValue) {
        resultFinder(pos - 1, remainingL - 1, numbers[pos]);
        cout << numbers[pos] << ' ';
    } else {
        resultFinder(pos - 1, remainingL, lastValue);
    }
}

int bSearch(int value) {
    int st = 1, dr = maxL;
    int mij, result = 0;

    while (st <= dr) {
        mij = (st + dr) / 2;

        if (minValue[mij] < value) {
            result = mij;
            st = mij + 1;
        } else {
            dr = mij - 1;
        }
    }

    return result;
}

int main() {
    cin >> n;

    for (auto i = 1; i <= n; i++) {
        cin >> numbers[i];
    }

    for (auto i = 1; i <= n; i++) {
        int result = bSearch(numbers[i]);

        if (result == maxL) {
            maxL++;
        }

        length[i] = result + 1;
        minValue[result + 1] = numbers[i];

        if (length[i] > length[finale]) {
            finale = i;
        }
    }

    cout << length[finale] << ' ';

    resultFinder(finale, length[finale], numbers[finale] + 1);
    return 0;
}