#include <bits/stdc++.h>
#define IOS ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define _zero(a) memset(a, 0, sizeof(a))
#define endl '\n'
#define int long long
#define mp make_pair
#define PII pair<int, int>
#define x first
#define y second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define PII pair<int, int>
typedef long long ll;
typedef double dd;
typedef long double ld;
using namespace std;
const int inf = 1e10;
const int M = 998244353;
const ld pi = atan2(0, -1);//arctan(y/x);
const ld eps = 1e-8;
int change[4][4];
int get(int x, int y){
return x * 4 + y;
}
void get_change()
{
_zero(change);
for(int i = 0; i < 4; i++){
for(int j = 0; j < 4; j++){
for(int k = 0; k < 4; k++){
change[i][j] += 1 << get(i, k);
change[i][j] += 1 << get(k, j);
}
change[i][j] -= 1 << get(i, j);
}
}
}
signed main()
{
IOS;
int state = 0;
char s;
for(int i = 0; i < 4; i++){
for(int j = 0; j < 4; j++){
cin >> s;
if(s == '-') state += 1 << get(i, j);
}
}
get_change();
vector<PII> res;
for(int k = 0; k < 1 << 16; k++){
int newone = state;
vector<PII> path;
for(int v = 0; v <= 15; v++){
if(k >> v & 1){
int row = v / 4, col = v % 4;
newone ^= change[row][col];
path.push_back({row, col});
}
}
if(newone == (1 << 16) - 1 && (res.empty() || res.size() > path.size())) res = path;
}
cout << res.size() << endl;
for(auto v : res) cout << v.x + 1 << " " << v.y + 1 << endl;
return 0;
}