#include<bits/stdc++.h>
using namespace std;
int n;
int fx[4]={0,-1,0,1};
int fy[4]={1,0,-1,0};
char a[24][24];
int c[401][3];
void dfs(int x,int y,int k){
    c[k][1]=x;
	c[k][2]=y;
	a[x][y]='1';
//	cout<<x<<y;
	if(x==n&&y==n){
		for(int i=1;i<=k;i++){
					cout<<"("<<c[i][1]<<","<<c[i][2]<<")";
					if(i==k)cout<<"";
					else cout<<"->";
		}
		exit(0);
	}
	else {
	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'){	
			dfs(tx,ty,k+1);
		}
    }	
	}
	
}
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);
   return 0;
}

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