#include<bits/stdc++.h>

#define ll long long
#define pp push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define ld long double
#define PI acos(-1)
#define sin(a) sin((a)*PI/180)
#define cos(a) cos((a)*PI/180)
#define ones(x) __builtin_popcountll(x)
//#define int ll

using namespace std;

void Drakon() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

unsigned long long inf = 1e10;
const double EPS = 1e-6;
const int MOD = 1000000007, N = 200005, LOG = 25;

ll gcd(ll x, ll y) {
    return y ? gcd(y, x % y) : x;
}

ll lcm(ll a, ll b) {
    return (a * b) / __gcd(a, b);
}

ll mul(const ll &a, const ll &b) {
    return (a % MOD + MOD) * (b % MOD + MOD) % MOD;
}

ll add(const ll &a, const ll &b) {
    return (a + b + 2 * MOD) % MOD;
}

ll pw(ll x, ll y) {
    ll ret = 1;
    while (y > 0) {
        if (y % 2 == 0) {
            x = mul(x, x);
            y = y / 2;
        } else {
            ret = mul(ret, x);
            y = y - 1;
        }
    }
    return ret;
}

void solve() {
    int n;
    cin >> n;
    vector<int>vec(n);
    for (int i = 0; i < n; ++i) {
        cin >> vec[i];
    }

    for (int i = 0; i < n; ++i) {
        cout << 1 << endl;
    }

    int cur = 1;
    while (!vec.empty()){
        int sz = (int)vec.size();
        for (int i = sz - 1; i >= 0; --i) {
            if(vec[i] == cur){
                for (int j = 0; j < sz - 1 - i; ++j) {
                    cout << 12 << endl;
                }
                cout << -1 << endl;
                for (int j = 0; j < sz - 1 - i; ++j) {
                    cout << 21 << endl;
                }
                vec.erase(vec.begin() + i);
                break;
            }
        }
        cur ++;
    }
}

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