#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int n;
struct nond{ int x,y,to; }v[6];
int map[6][8],mid[6][8];
bool judge(){for(int i=1;i<=5;i++)if(map[i][1])    return false;return true;
}
void down(){for(int i=1;i<=5;i++)for(int j=1;j<=7;j++){int x=i,y=j;while(map[x][y]&&!map[x][y-1]&&y-1>=1){swap(map[x][y],map[x][y-1]);y--;}}
}
void move(){down();int flag=0;for(int i=1;i<=5;i++)for(int j=1;j<=7;j++)mid[i][j]=map[i][j];for(int i=1;i<=5;i++)for(int j=1;j<=7;j++){if(!mid[i][j])    break;if(mid[i][j]==mid[i-1][j]&&mid[i][j]==mid[i+1][j]){flag=1;map[i][j]=map[i+1][j]=map[i-1][j]=0;}if(mid[i][j]==mid[i][j-1]&&mid[i][j]==mid[i][j+1]){flag=1;map[i][j]=map[i][j+1]=map[i][j-1]=0;} }if(flag){ down();move(); }
}
void dfs(int tot){if(tot==n){if(judge()){for(int i=1;i<=n;i++)    printf("%d %d %d\n",v[i].x-1,v[i].y-1,v[i].to);exit(0);    }return ;}int tmp[6][8];for(int i=1;i<=5;i++)for(int j=1;j<=7;j++){if(!map[i][j])    break;for(int a=1;a<=5;a++)for(int b=1;b<=7;b++)tmp[a][b]=map[a][b];if(i+1<=5&&map[i+1][j]!=map[i][j]){swap(map[i][j],map[i+1][j]);v[tot+1].x=i;v[tot+1].y=j;v[tot+1].to=1;move();dfs(tot+1);for(int a=1;a<=5;a++)for(int b=1;b<=7;b++)map[a][b]=tmp[a][b];}if(i-1>=1&&!map[i-1][j]){swap(map[i][j],map[i-1][j]);v[tot+1].x=i;v[tot+1].y=j;v[tot+1].to=-1;move();dfs(tot+1);for(int a=1;a<=5;a++)for(int b=1;b<=7;b++)map[a][b]=tmp[a][b];}}
}
int main(){scanf("%d",&n);for(int i=1;i<=5;i++){int x;while(scanf("%d",&x)&&x!=0)map[i][++map[i][0]]=x;}dfs(0);printf("-1");
}
/*
3
1 0
2 1 0
2 3 4 0
3 1 0
2 4 3 4 0
*/