#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cfloat>
#include <ctime>
#include <cassert>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <numeric>
#include <list>
#include <iomanip>
#include <fstream>
#include <bitset>
   
using namespace std;
   
 
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define foreach(it, c) for (__typeof__((c).begin()) it=(c).begin(); it != (c).end(); ++it)
#define rforeach(it, c) for (__typeof__((c).rbegin()) it=(c).rbegin(); it != (c).rend(); ++it)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define CL(arr, val) memset(arr, val, sizeof(arr))
#define COPY(dest, src) memcpy(dest, src, sizeof(dest))
#define ten(n) ((long long)(1e##n))
#define bin(n) (1LL << (n))
#define erep(i, n) for (int i = 0; i <= (int)(n); ++i)
#define revrep(i, n) for (int i = (n); i >= 0; --i)
#define pb push_back

template <class T> void chmax(T& a, const T& b) { a = max(a, b); }
template <class T> void chmin(T& a, const T& b) { a = min(a, b); }

template <class T> void uniq(T& c) { sort(c.begin(), c.end()); c.erase(unique(c.begin(), c.end()), c.end()); }
 
template <class T> string to_s(const T& a) { ostringstream os; os << a; return os.str(); }
template <class T> T to_T(const string& s) { istringstream is(s); T res; is >> res; return res; }

template <typename T> void print_container(ostream& os, const T& c) { const char* _s = " "; if (!c.empty()) { __typeof__(c.begin()) last = --c.end(); foreach (it, c) { os << *it; if (it != last) cout << _s; } } }
template <typename T> ostream& operator<<(ostream& os, const vector<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const set<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& c) { print_container(os, c); return os; }
template <typename T> ostream& operator<<(ostream& os, const deque<T>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& c) { print_container(os, c); return os; }
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << "( " << p.first << ", " << p.second << " )"; return os; }

template <class T> void print(T a, int n, const string& deli = " ", int br = 1) { for (int i = 0; i < n; ++i) { cout << a[i]; if (i + 1 != n) cout << deli; } while (br--) cout << endl; }
template <class T> void print2d(T a, int w, int h, int width = -1, int br = 1) { for (int i = 0; i < h; ++i) { for (int j = 0; j < w; ++j) {    if (width != -1) cout.width(width); cout << a[i][j] << ' '; } cout << endl; } while (br--) cout << endl; }

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

void fix_pre(int n) { cout.setf(ios::fixed, ios::floatfield); cout.precision(10); }
void fast_io() { cin.tie(0); ios::sync_with_stdio(false); }
#define trace(x) (cout << #x << ": " << (x) << endl)
 
bool in_rect(int x, int y, int w, int h) { return 0 <= x && x < w && 0 <= y && y < h; }


typedef long long ll;
typedef pair<int, int> pint;
 
// y(v): v>^<  y(^): ^>v<
const int dx[] = { 0, 1, 0, -1 };
const int dy[] = { 1, 0, -1, 0 };

const double PI = acos(-1.0);


int small[] = { 0, 1, 0, 1, 1, 1, 0, 1, 0 };
int med[]   = { 1, 1, 1, 1, 1, 1, 1, 1, 1 };
int large[] = {
    0, 0, 1, 0, 0,
    0, 1, 1, 1, 0,
    1, 1, 1, 1, 1,
    0, 1, 1, 1, 0,
    0, 0, 1, 0, 0,
};
const int* drop[] = { large, small, med };
const int table[] = { 3, 1, 2 };
const int size[] = { 5, 3, 3 };

int sum;
int a[16][16];
vector<pair<pint, int> > res;
bool in(int x, int y, int kind)
{
    return in_rect(x + size[kind] - 1, y + size[kind] - 1, 10, 10);
}
bool gao(int x, int y, int kind, int d)
{
    if (!in(x, y, kind))
        return false;

    int s = size[kind];
    bool ok = true;
    rep(i, s) rep(j, s)
    {
        if (drop[kind][i * s + j])
        {
            sum += d;
            if ((a[y + i][x + j] += d) < 0)
                ok = false;
        }
    }
    return ok;
}

bool dfs(int x, int y, int rem)
{
    if (rem == 0 && sum == 0)
        return true;
    else if (rem == 0 || y == 10)
        return false;

    int nx = x + 1, ny = y;
    if (nx == 10)
        nx = 0, ++ny;
    if (a[y][x] == 0)
        if (dfs(nx, ny, rem))
            return true;

    rep(kind, 3)
    {
        if (gao(x, y, kind, -1))
        {
            res.pb(make_pair(pint(x, y), kind));
            if (dfs(x, y, rem - 1))
                return true;
            res.pop_back();
        }
        gao(x, y, kind, +1);
    }

    return false;
}
int main()
{
    int rem;
    cin >> rem;
    rep(i, 10) rep(j, 10)
        cin >> a[i][j];

    sum = 0;
    rep(i, 10) rep(j, 10)
        sum += a[i][j];
    res.clear();

    assert(dfs(0, 0, rem));
    assert(res.size() == rem);
    rep(i, rem)
    {
        int kind = res[i].second;
        int rk = table[kind];
        int diff = size[kind] / 2;
        int x = res[i].first.first + diff;
        int y = res[i].first.second + diff;
        printf("%d %d %d\n", x, y, rk);
    }
}