#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll<<50;
template<typename T>
void printv(const vector<T>& s) {
  for(int i=0;i<(int)(s.size());++i) {
    cout << s[i];
    if(i == (int)(s.size())-1) cout << endl;
    else cout << " ";
  }
}
int n;
template< typename flow_t, typename cost_t >
struct PrimalDual {
  const cost_t INF;
  struct edge {
    int to;
    flow_t cap;
    cost_t cost;
    int rev;
    bool isrev;
  };
  vector< vector< edge > > graph;
  vector< cost_t > potential, min_cost;
  vector< int > prevv, preve;
  PrimalDual(int V) : graph(V), INF(numeric_limits< cost_t >::max()) {}
  void add_edge(int from, int to, flow_t cap, cost_t cost) {
    graph[from].emplace_back((edge) {to, cap, cost, (int) graph[to].size(), false});
    graph[to].emplace_back((edge) {from, 0, -cost, (int) graph[from].size() - 1, true});
  }
  cost_t min_cost_flow(int s, int t, flow_t f) {
    int V = (int) graph.size();
    cost_t ret = 0;
    using Pi = pair< cost_t, int >;
    priority_queue< Pi, vector< Pi >, greater< Pi > > que;
    potential.assign(V, 0);
    preve.assign(V, -1);
    prevv.assign(V, -1);
    while(f > 0) {
      min_cost.assign(V, INF);
      que.emplace(0, s);
      min_cost[s] = 0;
      while(!que.empty()) {
        Pi p = que.top();
        que.pop();
        if(min_cost[p.second] < p.first) continue;
        for(int i = 0; i < graph[p.second].size(); i++) {
          edge &e = graph[p.second][i];
          cost_t nextCost = min_cost[p.second] + e.cost + potential[p.second] - potential[e.to];
          if(e.cap > 0 && min_cost[e.to] > nextCost) {
            min_cost[e.to] = nextCost;
            prevv[e.to] = p.second, preve[e.to] = i;
            que.emplace(min_cost[e.to], e.to);
          }
        }
      }
      if(min_cost[t] == INF) return -1;
      for(int v = 0; v < V; v++) potential[v] += min_cost[v];
      flow_t addflow = f;
      for(int v = t; v != s; v = prevv[v]) {
        addflow = min(addflow, graph[prevv[v]][preve[v]].cap);
      }
      f -= addflow;
      ret += addflow * potential[t];
      for(int v = t; v != s; v = prevv[v]) {
        edge &e = graph[prevv[v]][preve[v]];
        e.cap -= addflow;
        graph[v][e.rev].cap += addflow;
      }
    }
    return ret;
  }
  void output(vector<P> &v) {
    for(int i = 0; i < graph.size(); i++) {
      for(auto &e : graph[i]) {
        if(e.isrev) continue;
        if(!(1 <= i && i <= n)) continue;
        auto &rev_e = graph[e.to][e.rev];
        if(!rev_e.cap) continue;
        v.push_back({i-1, e.to-n-1});
      }
    }
  }
};
int main() {
  cin.tie(0);
  cout << fixed << setprecision(10);
  cin >> n;
  vvi w(n, vi(n)), e(n, vi(n));
  for(int i=0;i<n;++i) {
    for(int j=0;j<n;++j) {
      cin >> w[i][j];
    }
  }
  for(int i=0;i<n;++i) {
    for(int j=0;j<n;++j) {
      cin >> e[i][j];
    }
  }
  vector<string> s(n);
  for(int i=0;i<n;++i) {
    cin >> s[i];
  }
  PrimalDual<ll, ll> flow(2*n+2);
  for(int i=0;i<n;++i) {
    flow.add_edge(0, i+1, 1, 0);
  }
  for(int i=0;i<n;++i) {
    flow.add_edge(n+1+i, 2*n+1, 1, 0);
  }
  ll ans = 0;
  for(int i=0;i<n;++i) {
    for(int j=0;j<n;++j) {
      if(s[i][j] == 'o') {
        ans += e[i][j];
        flow.add_edge(i+1, n+1+j, 1, -e[i][j]);
      } else {
        flow.add_edge(i+1, n+1+j, 1, w[i][j]);
      }
    }
  }
  cout << ans + flow.min_cost_flow(0, 2*n+1, n) << endl;
  vector<P> v;
  flow.output(v);
  map<P, bool> sel;
  for(int i=0;i<(int)(v.size());++i) {
    sel[v[i]] = true;
  }
  vector<P> sousa;
  for(int i=0;i<n;++i) {
    for(int j=0;j<n;++j) {
      if(s[i][j] == 'o' && !sel[{i, j}]) {
        sousa.push_back({i, j});
      } else if(s[i][j] == '.' && sel[{i, j}]) {
        sousa.push_back({i, j});
      }
    }
  }
  cout << (int)(sousa.size()) << endl;
  for(int i=0;i<(int)(sousa.size());++i) {
    int j = sousa[i].first, k = sousa[i].second;
    if(s[j][k] == 'o') {
      cout << j+1 << " " << k+1 << " " << "erase" << endl;
    } else {
      cout << j+1 << " " << k+1 << " " << "write" << endl;
    }
  }
}



Measured memory_bytes: 4488