#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <ctime>
#include <iterator>
#include <bitset>
#include <numeric>
#include <list>
#include <iomanip>
#include <cassert>
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
 
class bipartite_matching {
public:
    int n;
    vector<vector<int>> g;
    vector<int> match;
 
    bipartite_matching(int n_) : n(n_), g(n_), match(n_), used(n_) {}
 
    void add_edge(int u, int v) {
        g[u].push_back(v);
        g[v].push_back(u);
    }
 
    int maximum_matching(void) {
        int res = 0;
        fill(begin(match), end(match), -1);
        for (int v = 0; v < n; ++v) {
            if (match[v] == -1) {
                fill(begin(used), end(used), false);
                if (dfs(v)) res++;
            }
        }
        return res;
    }
 
private:
    vector<int> used;
    bool dfs(int v) {
        used[v] = true;
        for (int u : g[v]) {
            int w = match[u];
            if (w == -1 || (!used[w] && dfs(w))) {
                match[v] = u; match[u] = v;
                return true;
            }
        }
        return false;
    }
};
 
using Flow = int;
using Cost = int;
const int MAX_V = 100000;
const Cost INF = numeric_limits<Cost>::max() / 8;
 
struct PrimalDual {
    struct Edge {
        int d; Flow c, f; Cost w; int r, is_r;
        Edge(int d_, Flow c_, Flow f_, Cost w_, int r_, bool is_r_)
            :d(d_), c(c_), f(f_), w(w_), r(r_), is_r(is_r_) {}
    };
 
    int n;
    vector<vector<Edge> > g;
    PrimalDual(int n_) : n(n_), g(vector<vector<Edge> >(n_)) {}
 
    void add_edge(int src, int dst, Flow cap, Cost cost) { // ?????????
        int rsrc = g[dst].size();
        int rdst = g[src].size();
        g[src].emplace_back(dst, cap, 0, cost, rsrc, false);
        g[dst].emplace_back(src, cap, cap, -cost, rdst, true);
    }
 
    Cost solve(int s, int t, Flow f) {
        Cost res = 0;
 
        static Cost h[MAX_V + 10], dist[MAX_V];
        static int prevv[MAX_V + 10], preve[MAX_V + 10];
        // vector<Cost> h(g.size()), dist(g.size());
        // vector<int> prevv(g.size()), preve(g.size());
 
        using pcv = pair<Cost, int>;
        priority_queue<pcv, vector<pcv>, greater<pcv> > q;
        fill(h, h + n, 0);
        while (f > 0) {
            fill(dist, dist + n, INF);
            dist[s] = 0;
            q.emplace(0, s);
            while (q.size()) {
                Cost cd; int v;
                tie(cd, v) = q.top();
                q.pop();
                if (dist[v] < cd) continue;
                for (int i = 0; i < (int)g[v].size(); ++i) {
                    Edge &e = g[v][i];
                    if (residue(e) == 0) continue;
                    if (dist[e.d] + h[e.d] > cd + h[v] + e.w) {
                        dist[e.d] = dist[v] + e.w + h[v] - h[e.d];
                        prevv[e.d] = v;
                        preve[e.d] = i;
                        q.emplace(dist[e.d], e.d);
                    }
                }
            }
 
            if (dist[t] == INF) {
                return -1; // ?????????????????????????????テつ」???
            }
 
            // s-t ????????????????????テつ」??????????????????
            for (int i = 0; i < n; ++i) h[i] += dist[i];
            Flow d = f;
            for (int v = t; v != s; v = prevv[v]) {
                d = min(d, residue(g[prevv[v]][preve[v]]));
            }
            f -= d;
            res += d * h[t];
            for (int v = t; v != s; v = prevv[v]) {
                Edge &e = g[prevv[v]][preve[v]];
                e.f += d;
                g[v][e.r].f -= d;
            }
        }
        return res;
    }
 
    Flow residue(const Edge &e) { return e.c - e.f; }
 
    // ???????????テつィ???
    void show() {
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < (int)(g[i].size()); ++j) {
                Edge &e = g[i][j];
                if (e.is_r) continue;
                printf("%3d->%3d (flow:%d)\n", i, e.d, e.f);
            }
        }
    }
};
 
int n;
int W[128][128], E[128][128];
char f[128][128];
int ans[10000][3];
 
int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
 
    cin >> 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];
        }
    }
 
    for (int i = 0; i < n; i++) {
        cin >> f[i];
    }
 
    int C = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (f[i][j] == 'o') {
                C += E[i][j];
            }
        }
    }
 
    PrimalDual pd(n * 2 + 2);
 
    int s = n * 2, t = n * 2 + 1;
    for (int i = 0; i < n; i++) {
        pd.add_edge(s, i, 1, 0);
        pd.add_edge(i + n, t, 1, 0);
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            pd.add_edge(i, j + n, 1, f[i][j] == 'o' ? -E[i][j] : W[i][j]);
        }
    }
 
    cout << C + pd.solve(s, t, n) << '\n';
 
    int cnt = 0;
    for (int i = 0; i < pd.g.size(); i++) {
        for (auto &e : pd.g[i]) {
            if (e.is_r || e.w == 0) continue;
            if (f[i][e.d - n] == 'o' && e.f == 0) {
                ans[cnt][0] = i;
                ans[cnt][1] = e.d - n;
                ans[cnt][2] = 0;
                cnt++;
            } else if (f[i][e.d - n] == '.' && e.f == 1) {
                ans[cnt][0] = i;
                ans[cnt][1] = e.d - n;
                ans[cnt][2] = 1;
                cnt++;
            }
        }
    }
 
    cout << cnt << '\n';
    for (int i = 0; i < cnt; i++) {
        ans[i][0]++;
        ans[i][1]++;
        cout << ans[i][0] << ' ' << ans[i][1] << (ans[i][2] == 0 ? " erase\n" : " write\n");
    }
}

Measured memory_bytes: 3752