#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define REPR(i,n) for (int i=(int)(n)-1;i>=0;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename Ch,typename Tr,typename C,typename=decltype(begin(C()))>basic_ostream<Ch,Tr>& operator<<(basic_ostream<Ch,Tr>&os,
const C& c){os<<'[';for(auto i=begin(c);i!=end(c);++i)os<<(i==begin(c)?"":" ")<<*i;return os<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)cout<<a[i]<<(i!=n-1?',':'\n');}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}

vector<int> dy[3];
vector<int> dx[3];
int w[3], h[3];
int a[10][10];
tuple<int,int,int> ans[12];

bool solve(int n, int y, int x, int rest) {
  // if (n * 13 < rest || n * 5 > rest) return 0;
  if (n == 0) return 1;
  if (x == 10) return solve(n,y+1,0,rest);
  if (y == 10) return 0;
  if (a[y][x] == 0) return solve(n,y,x+1,rest);
  // cout << tpl(n,y,x,rest) << endl;
  // REP(i,10)REP(j,10)printf("%d%c",a[i][j],j==9?'\n':' ');
  REP(type,3) {
    if (y+h[type]>=10) continue;
    if (x-w[type]<0 || x+w[type]>=10) continue;
    if ((int)dy[type].size() > rest) continue;
    bool ok = 1;
    REP(i,dy[type].size()) {
      ok &= a[y+dy[type][i]][x+dx[type][i]] >= 1;
    }
    if (ok) {
      REP(i,dy[type].size()) {
        a[y+dy[type][i]][x+dx[type][i]]--;
      }
      ans[n-1] = tpl(y,x,type);
      if (solve(n-1, y, x, rest - dy[type].size())) return 1;
      REP(i,dy[type].size()) {
        a[y+dy[type][i]][x+dx[type][i]]++;
      }
    }
  }
  return 0;
}
int main() {
  w[0] = 2; w[1] = w[2] = 1;
  h[0] = 4; h[1] = h[2] = 2;
  dy[0] = {0,1,1,1,2,2,2,2,2,3,3,3,4};
  dx[0] = {0,-1,0,1,-2,-1,0,1,2,-1,0,1,0};
  dy[1] = {0,0,0,1,1,1,2,2,2};
  dx[1] = {0,1,2,0,1,2,0,1,2};
  dy[2] = {0,1,1,1,2};
  dx[2] = {0,-1,0,1,0};
  int N;
  while(cin >> N) {
    int sum = 0;
    REP(i,10) REP(j,10) {
      cin >> a[i][j];
      sum += a[i][j];
    }
    solve(N,0,0,sum);
    REP(i,N) {
      int y,x,t;
      tie(y,x,t) = ans[i];
      y += w[t];
      x += t == 1;
      t = 3-t;
      printf("%d %d %d\n", x,y,t);
    }
  }
}