#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef pair<int,int> pint;
typedef pair<long long, long long> pll;

#define MP make_pair
#define PB push_back
#define ALL(s) (s).begin(),(s).end()
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) 
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P) 
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) 
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s; }



const string paint[3][5] = 
{
    {
        "..#..",
        ".###.",
        "..#..",
        ".....",
        "....."
    },
    {
        "..###",
        "..###",
        "..###",
        ".....",
        "....."
    },
    {
        "..#..",
        ".###.",
        "#####",
        ".###.",
        "..#.."
    }
};

const int dy[3] = {1, 1, 2};
const int dx[3] = {0, 1, 0};

bool solve(vector<vint> &s, int n, int y, int x) {
    if (x == 15) {
        ++y;
        x = 5;
        if (y == 15) return n == 0;
    }
    
    if (s[y][x] == 0) return solve(s, n, y, x+1);
    if (n == 0) return false;
    
    for (int k = 0; k < 3; ++k) {
        bool ok = true;
        for (int i = 0; i < 5; ++i) {
            for (int j = 0; j < 5; ++j) {
                if (paint[k][i][j] == '#' && s[y+i][x+j-2] == 0)
                    ok = false;
            }
        }
        if (!ok) continue;
        
        for (int i = 0; i < 5; ++i) 
            for (int j = 0; j < 5; ++j) 
                if (paint[k][i][j] == '#')
                    --s[y+i][x+j-2];

        if (solve(s, n-1, y, x)) {
            cout << (x - 5 + dx[k]) << " " << (y - 5 + dy[k]) << " " << (k+1) << endl;
            return true;
        }
        
        for (int i = 0; i < 5; ++i) 
            for (int j = 0; j < 5; ++j)
                if (paint[k][i][j] == '#')
                    ++s[y+i][x+j-2];
    }
    
    return false;
}
        

int main() {
    int n;
    cin >> n;
    
    vector<vint> s(20, vint(20));
    for (int i = 5; i < 15; ++i)
        for (int j = 5; j < 15; ++j)
            cin >> s[i][j];
    
    solve(s, n, 5, 5);
    
    return 0;
}
