#include<bits/stdc++.h>
using namespace std;
int n;
char a[24][24];
int fx[4]={0,-1,0,1};
int fy[4]={1,0,-1,0};
int b[24][24];
void dfs(int x,int y,int k){
    b[1][1]=1;
	a[x][y]='1';
	if(x==n&&y==n){
		for(int i=1;i<=n;i++){
			for(int j=1;j<=n;j++){
				if(b[i][j]!=0){
					cout<<"("<<i<<","<<j<<")";
					if(i==n&&j==n)cout<<"";
					else cout<<"->";
				}
			}
		}
		exit(0);
	}
	int l=0;
	for(int i=0;i<=3;i++){
		int tx=x+fx[i];
		int ty=y+fy[i];
		if(tx>=1&&tx<=n&&ty>=1&&ty<=n&&a[tx][ty]=='0'){	
		    b[tx][ty]=k;
			dfs(tx,ty,k+1);
		}
		else {
		l++;	
	    }
	    if(l==4){
	    	for(int i=1;i<=n;i++){
	    		for(int j=1;j<=n;j++){
	    			b[i][j]=0;
	    		}
	    	}
	    }
    }
}
int main(){
   cin>>n;
   for(int i=1;i<=n;i++){
   	for(int j=1;j<=n;j++){
   		cin>>a[i][j];
   	}
   }
   dfs(1,1,1);//从1,1开始 
   return 0;
}

/**************************************************************
	Problem: 1431
	User: chenjingqi
	Language: C++
	Result: Wrong Answer
****************************************************************/