#include <bits/stdc++.h>
using namespace std;
struct BigNum {
  vector<long long> value;
  void set(long long x) {
    value = *(new vector<long long>);
    value.push_back(x);
  }
  void duplicate(BigNum other) { value = other.value; }
  void add(BigNum other) {
    vector<long long> o = other.value;
    if (o.size() > value.size()) {
      vector<long long> t = value;
      value = o;
      o = t;
    }
    for (int i = 0; i < o.size(); i += 1) {
      value[i] += o[i];
      if (i < value.size() - 1 && value[i] >= (long long)1e9) {
        value[i + 1] += value[i] / (long long)1e9;
        value[i] = value[i] % (long long)1e9;
      }
    }
    if (value.back() >= (long long)1e9) {
      value.push_back(value.back() / (long long)1e9);
      value[value.size() - 2] = value[value.size() - 2] % (long long)1e9;
    }
  }
  void mul(long long mul) {
    for (int i = 0; i < value.size(); i += 1) {
      value[i] *= mul;
    }
    for (int i = 0; i < value.size() - 1; i += 1) {
      if (value[i] >= (long long)1e9) {
        value[i + 1] += value[i] / (long long)1e9;
        value[i] = value[i] % (long long)1e9;
      }
    }
    if (value.back() >= (long long)1e9) {
      value.push_back(value.back() / (long long)1e9);
      value[value.size() - 2] = value[value.size() - 2] % (long long)1e9;
    }
  }
  long double div(BigNum other1, BigNum other2) {
    int s = value.size();
    long double current = value.back();
    if (s >= 2) {
      current += ((long double)value[s - 2]) / (long long)1e9;
    }
    if (s >= 3) {
      current +=
          ((long double)value[s - 3]) / ((long long)1e9 * (long long)1e9);
    }
    int s1 = other1.value.size();
    int s2 = other2.value.size();
    long double other = 0;
    if (s1 + s2 - 1 == s) {
      other += other1.value.back() * other2.value.back();
      if (s1 >= 2) {
        other += ((long double)other1.value[s1 - 2] * other2.value.back()) /
                 (long long)1e9;
      }
      if (s2 >= 2) {
        other += ((long double)other2.value[s2 - 2] * other1.value.back()) /
                 (long long)1e9;
      }
      if (s1 >= 3) {
        other += ((long double)other1.value[s1 - 3] * other2.value.back()) /
                 ((long long)1e9 * (long long)1e9);
      }
      if (s2 >= 3) {
        other += ((long double)other2.value[s2 - 3] * other1.value.back()) /
                 ((long long)1e9 * (long long)1e9);
      }
    }
    if (s1 + s2 - 1 == s - 1) {
      other += other1.value.back() * other2.value.back();
      if (s1 >= 2) {
        other += ((long double)other1.value[s1 - 2] * other2.value.back()) /
                 (long long)1e9;
      }
      if (s2 >= 2) {
        other += ((long double)other2.value[s2 - 2] * other1.value.back()) /
                 (long long)1e9;
      }
      other /= (long long)1e9;
    }
    if (s1 + s2 - 1 == s - 2) {
      other += other1.value.back() * other2.value.back();
      other /= (long long)1e9 * (long long)1e9;
    }
    return other / current;
  }
  string stringify() {
    string out = to_string(value.back());
    for (int i = value.size() - 1 - 1; i > -1; i -= 1) {
      string cur = to_string(value[i] + (long long)1e9);
      out += cur.substr(1);
    }
    return out;
  }
};
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
long long triangle(long long x) { return (((long long)(x + 1)) * (x)) / 2; }
long long modInverse(long long a) {
  long long m = 1000000007;
  long long y = 0, x = 1;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) {
    x += 1000000007;
  }
  return x;
}
long long modInverse(long long a, long long b) {
  long long m = b;
  long long y = 0, x = 1;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) {
    x += b;
  }
  return x;
}
long long pow(long long a, long long b) {
  if (a <= 1) {
    return a;
  }
  if (b == 0) {
    return 1;
  }
  if (b % 2 == 0) {
    return pow((a * a) % 1000000007, b / 2) % 1000000007;
  }
  return (a * pow((a * a) % 1000000007, b / 2)) % 1000000007;
}
vector<long long> dev(vector<pair<long long, long long> > divisors) {
  if (divisors.size() == 0) {
    vector<long long> cur;
    cur.push_back(1);
    return cur;
  }
  long long x = divisors.back().first;
  long long n = divisors.back().second;
  divisors.pop_back();
  vector<long long> ans = dev(divisors);
  vector<long long> cur;
  long long xi = 1;
  for (int i = 0; i < n + 1; i += 1) {
    for (int j = 0; j < ans.size(); j += 1) {
      cur.push_back(ans[j] * xi);
    }
    xi *= x;
  }
  return cur;
}
void add(vector<int>& x, vector<int>& y) {
  for (int i = 0; i < x.size(); i += 1) {
    x[i] += y[i];
  }
}
struct pt {
  long long x, y;
  long long d() const { return x * x + y * y; }
};
inline pt operator-(const pt& a) { return {-a.x, -a.y}; }
inline pt operator+(const pt& a, const pt& b) { return {a.x + b.x, a.y + b.y}; }
inline pt operator-(const pt& a, const pt& b) { return {a.x - b.x, a.y - b.y}; }
inline long long operator*(const pt& a, const pt& b) {
  return a.x * b.y - a.y * b.x;
}
inline bool operator<(const pt& a, const pt& b) { return a * b < 0; }
inline bool operator<=(const pt& a, const pt& b) { return a * b <= 0; }
inline long long operator/(const pt& a, const pt& b) {
  return a.x * b.x + a.y * b.y;
}
inline bool operator==(const pt& a, const pt& b) {
  return a.x == b.x && a.y == b.y;
}
inline bool operator!=(const pt& a, const pt& b) {
  return a.x != b.x || a.y != b.y;
}
pt o = {0, 0};
bool comp(pt a, pt b) { return (a - o) * (b - o) < 0; }
long long m = 201000;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  long long n;
  cin >> n;
  vector<vector<int> > a(n, vector<int>(n));
  vector<int> b(2 * n, -1);
  vector<vector<int> > cons(2 * n);
  vector<vector<int> > opcons(2 * n);
  for (int i = 0; i < n; i += 1) {
    string line;
    cin >> line;
    for (int j = 0; j < n; j += 1) {
      a[i][j] = (line[j] - '0') ^ a[i][j];
    }
  }
  for (int i = 0; i < n; i += 1) {
    string line;
    cin >> line;
    for (int j = 0; j < n; j += 1) {
      a[i][j] = (line[j] - '0') ^ a[i][j];
    }
  }
  string line;
  cin >> line;
  bool ok = true;
  vector<int> left;
  vector<int> cheked(2 * n);
  for (int i = 0; i < 2 * n; i += 1) {
    left.push_back(i);
  }
  for (int i = 0; i < n; i += 1) {
    for (int j = 0; j < n; j += 1) {
      if (line[i] - '0' && line[j] - '0') {
        if (a[i][j]) {
          opcons[i].push_back(j + n);
          opcons[j + n].push_back(i);
        } else {
          cons[i].push_back(j + n);
          cons[j + n].push_back(i);
        }
      } else if (line[j] - '0') {
        if (b[i] != -1 && b[i] != a[i][j]) {
          ok = false;
        }
        b[i] = a[i][j];
        left.push_back(i);
      } else if (line[i] - '0') {
        if (b[j + n] != -1 && b[j + n] != a[i][j]) {
          ok = false;
        }
        b[j + n] = a[i][j];
        left.push_back(j + n);
      } else {
        if (a[i][j]) {
          ok = false;
        }
      }
    }
  }
  while (!left.empty() && ok) {
    int cur = left.back();
    left.pop_back();
    if (cheked[cur]) {
      continue;
    }
    cheked[cur] = 1;
    if (b[cur] == -1) {
      b[cur] = 0;
    }
    for (int i = 0; i < opcons[cur].size(); i += 1) {
      if (b[opcons[cur][i]] == -1) {
        b[opcons[cur][i]] = 1 ^ b[cur];
      }
      if (b[opcons[cur][i]] == b[cur]) {
        ok = false;
      }
      left.push_back(opcons[cur][i]);
    }
    for (int i = 0; i < cons[cur].size(); i += 1) {
      if (b[cons[cur][i]] == -1) {
        b[cons[cur][i]] = b[cur];
      }
      if (b[cons[cur][i]] != b[cur]) {
        ok = false;
      }
      left.push_back(cons[cur][i]);
    }
  }
  if (ok) {
    int sum = 0;
    for (int i = 0; i < 2 * n; i += 1) {
      sum += b[i];
    }
    cout << sum << endl;
    for (int i = 0; i < n; i += 1) {
      if (b[i]) {
        cout << "row " << i << endl;
      }
    }
    for (int i = 0; i < n; i += 1) {
      if (b[i + n]) {
        cout << "col " << i << endl;
      }
    }
  } else {
    cout << -1 << endl;
  }
  return 0;
}
