#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

// Problem Specific Parameter:

int board[10][10];
using state=tuple<int,int,int>;
vector<state> ans;

void dfs(int rest){
	if(rest==0){
		bool ng=false;;
		rep(i,10)rep(j,10) ng|=board[i][j];
		if(ng==false){
			for(auto &it:ans){
				int y,x,s;
				tie(y,x,s)=it;
				cout << x << " " << y << " " << s << endl;
			}
			exit(0);
		} 
		return;
	}

	rep(i,10)rep(j,10){
		if(board[i][j]==0) continue;

		// small
		{
			int num=0;
			int ci=i+1,cj=j;
			rep(a,10)rep(b,10) if(abs(a-ci)+abs(b-cj)<=1) num+=min(1,board[a][b]);

			if(num==5){
				rep(a,10)rep(b,10) if(abs(a-ci)+abs(b-cj)<=1) board[a][b]--;
				ans.push_back(state(ci,cj,1));
				dfs(rest-1);
				ans.pop_back();
				rep(a,10)rep(b,10) if(abs(a-ci)+abs(b-cj)<=1) board[a][b]++;
			}
		}

		// med
		{
			int num=0;
			int ci=i+1,cj=j+1;
			rep(a,10)rep(b,10) if(max(abs(a-ci),abs(b-cj))<=1) num+=min(1,board[a][b]);

			if(num==9){
				rep(a,10)rep(b,10) if(max(abs(a-ci),abs(b-cj))<=1) board[a][b]--;
				ans.push_back(state(ci,cj,2));
				dfs(rest-1);
				ans.pop_back();
				rep(a,10)rep(b,10) if(max(abs(a-ci),abs(b-cj))<=1) board[a][b]++;
			}
		}

		// large
		{
			int num=0;
			int ci=i+2,cj=j;
			rep(a,10)rep(b,10) if(abs(a-ci)+abs(b-cj)<=2) num+=min(1,board[a][b]);

			if(num==13){
				rep(a,10)rep(b,10) if(abs(a-ci)+abs(b-cj)<=2) board[a][b]--;
				ans.push_back(state(ci,cj,3));
				dfs(rest-1);
				ans.pop_back();
				rep(a,10)rep(b,10) if(abs(a-ci)+abs(b-cj)<=2) board[a][b]++;
			}
		}

		
		return;
	}
	return;
}


int main(void){
	int n;
	cin >> n;
	rep(i,10)rep(j,10) cin >> board[i][j];
	dfs(n);
	return 0;
}