#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int id[70000],fa[70000],step[70000];
int find(int x)
{
   int dir[16] = {63624,62532,61986,61713,36744,20292,12066,7953,35064,17652,
                  8946,4593,34959,17487,8751,4383};
   queue<int>q;
   q.push(x);
   memset(step,-1,sizeof(step));
   memset(fa,-1,sizeof(fa));
   step[x] = 0;
   int cur,temp;
   while (!q.empty()){
   	  cur = q.front();
   	  q.pop();
   	  for (int i=0; i<16; i++){
  	     temp = cur ^ dir[i];
  	     if (step[temp]==-1){
     	    step[temp] = step[cur]+1;
     	    q.push(temp);
     	    id[temp] = i;
     	    fa[temp] = cur;
  	     }
  	     if (!temp) return step[temp];
   	  }
   }
} 
void Output(int x)
{ 
   if (fa[x]!=-1){
      Output(fa[x]);
      printf("%d %d\n",id[x]/4+1,id[x]%4+1);
   }
}
main()
{
   char map[6];
   int st = 0;
   for  (int i=1; i<=4; i++){
   	  scanf("%s",map);
   	  for (int j=0; j<4; j++){
  	     st <<= 1;
  	     if (map[j]=='+')
  	        st++;
   	  }
   }
   printf("%d\n",find(st));
   Output(0);
}