#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

const int N = 1003;

struct DeadEnd {
    bool on_stack[N]{};
    stack<int> st;
    void push(int x) {
        st.push(x);
        on_stack[x] = true;
    }
    void pop() {
        on_stack[st.top()] = false;
        st.pop();
    }
    int top() const {
        return st.top();
    }
    bool contains(int x) const {
        return on_stack[x];
    }
};

int main() {
    ios::sync_with_stdio(false); cout.tie(nullptr); cin.tie(nullptr);
    queue<int> input;
    int n; cin >> n;
    for (int i = 1; i <= n; ++i) {
        int x; cin >> x;
        input.push(x);
    }
    DeadEnd s1, s2;
    for (int i = 1; i <= n; ++i) {
        if (s1.contains(i)) {
            for (; s1.top() != i; s1.pop()) {
                s2.push(s1.top());
                cout << "12\n";
            }
            cout << "-1\n";
            s1.pop();
            continue;
        }
        if (s2.contains(i)) {
            for (; s2.top() != i; s2.pop()) {
                s1.push(s2.top());
                cout << "21\n";
            }
            cout << "-2\n";
            s2.pop();
            continue;
        }
        while (true) {
            int x = input.front();
            input.pop();
            cout << "1\n";
            s1.push(x);
            if (x == i) break;
        }
        s1.pop();
        cout << "-1\n";
    }
    return 0;
}