#include <bits/stdc++.h>

#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;

template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;

    int n;
    cin >> n;
    vector< vector<pii> > cells(2);
    forn(i, n) forn(j, n) cells[(i + j) % 2].pb(mp(i, j));
    int moves_lft = n * n;
    while (moves_lft--) {
        int col1;
        cin >> col1;
        --col1;
        int col2;
        int parity;
        if (col1 == 2) {
            col2 = 0;
            while (cells[col2].empty()) ++col2;
            parity = col2;
        } else {
            if (cells[col1 ^ 1].empty()) {
                col2 = 2;
                parity = col1;
            } else {
                col2 = parity = col1 ^ 1;
            }
        }

        auto p = cells[parity].back();
        cells[parity].pop_back();
        cout << col2 + 1 << ' ' << p.fi + 1 << ' ' << p.se + 1 << endl;
    }

#ifdef LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
    return 0;
}
