#define io ios_base::sync_with_stdio(false);cin.tie(NULL);cin.tie(nullptr), cout.tie(nullptr);

#include <bits/stdc++.h>

#define ll long long
using namespace std;

const int N = 1e5 + 5;

void solve() {
    int n;
    cin >> n;
    int arr[n];
    int inStack[n + 1];
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
        inStack[arr[i]] = -1;
    }
    stack<int> s1, s2;
    int now = 1;
    for (int i = 0; i < n; ++i) {
        inStack[arr[i]] = 1;
        s1.push(arr[i]);
        cout << "1\n";
        if (inStack[now] != -1) {
            stack<int> &s = (inStack[now] == 1 ? s1 : s2);
            stack<int> &other = (inStack[now] == 1 ? s2 : s1);
            string cmd = (inStack[now] == 1 ? "12\n" : "21\n");
            while (s.top() != now) {
                cout << cmd;
                inStack[s.top()] = cmd[1] - '0';
                other.push(s.top());
                s.pop();
            }
            s.pop();
            cout << (inStack[now] == 1 ? "-1\n" : "-2\n");
            now++;
        }
    }
    while (now != n + 1) {
        stack<int> &s = (inStack[now] == 1 ? s1 : s2);
        stack<int> &other = (inStack[now] == 1 ? s2 : s1);
        string cmd = (inStack[now] == 1 ? "12\n" : "21\n");
        while (s.top() != now) {
            cout << cmd;
            inStack[s.top()] = cmd[1] - '0';
            other.push(s.top());
            s.pop();
        }
        cout << (inStack[now] == 1 ? "-1\n" : "-2\n");
        now++;
    }
}


signed main() {
    io
    int t;
    t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}