#include <iostream>
#include <unordered_map>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <iomanip>
#include <string>

#define f first
#define s second
#define pb push_back
#define ll long long
using namespace std;
const int N = 1e6+5;
int a[N], dp[N], p[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; ++i)
        cin >> a[i];

    for (int i = 0; i < n; ++i) {
        dp[i] = 1;
        for (int j = 0; j < i-1; ++j)
            if (a[i] > a[j])
                dp[i] = max(dp[i], dp[j]+1);
    }
    cout << dp[n-1] << '\n';
    int len = dp[n-1];

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < i-1; ++j) {
            if (a[i] > a[j]) {
                if (dp[i] < dp[j]+1) {
                    dp[i] = dp[j] + 1;
                    p[i] = j;
                }
            }
        }
    }

    for (int i = 0; i < n; ++i)
        cout << p[i] << " ";

    cout << '\n';

    for (int i = 0; i < len; ++i)
        cout << a[p[i]] << " ";

    return 0;
}