#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif
#define LDcout(x,n) fixed<<setprecision(n)<<x

#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
// ????°??????¨???(Min Cost Flow)

template <class T> class MinCostFlow {
public:
    // struct edge { int to, capacity; T cost;int reve;};
    class edge{
    public:
        int to;
        int capacity;
        T cost;
        int reve;
    
        edge(int _to, int _capacity, int _reve, T _cost){
          this->to = _to;
          this->capacity = _capacity;
          this->reve = _reve;
          this->cost = _cost;
        }
    };
    static const int MV = 300;//????????°
    vector<edge> E[MV];
    T dist[MV];
    int prev_v[MV], prev_e[MV], NV;
    
    MinCostFlow() { init(MV); }
    void init(int NV=MV) { this->NV=NV; for(int i=0;i<MV;i++) E[i].clear();}
    void addEdge(int x,int y, int cap, T cost) {
        E[x].push_back(edge(y,cap,E[y].size(),cost));
        E[y].push_back(edge(x,0,E[x].size()-1,-cost)); /* rev edge */
    }
    
    T minCost(int from, int to, int flow) {
        T res=0;
        T inf=std::numeric_limits<T>::max()/2;
        memset(prev_v,0,sizeof(prev_v));
        memset(prev_e,0,sizeof(prev_e));
        while(flow>0) {
            fill(dist, dist+NV, inf);
            dist[from]=0;
            bool up=true;
            while(up) {
                up=false;
                for(int v=0;v<NV;++v) {
                    if(dist[v]==inf) continue;
                    for(int i=0;i<E[v].size();++i) {
                        edge &e=E[v][i];
                        if(e.capacity>0 && dist[e.to]>dist[v]+e.cost) {
                            dist[e.to]=dist[v]+e.cost;
                            prev_v[e.to]=v;
                            prev_e[e.to]=i;
                            up=true;
                        }
                    }
                }
            }
            if(dist[to]==inf) return -1;
            int lc=flow;
            for(int v=to;v!=from;v=prev_v[v]){
                lc = min(lc, E[prev_v[v]][prev_e[v]].capacity);
            }
            flow -= lc;
            res += lc*dist[to];
            for(int v=to;v!=from;v=prev_v[v]) {
                edge &e=E[prev_v[v]][prev_e[v]];
                e.capacity -= lc;
                E[v][e.reve].capacity += lc;
            }
        }
        return res;
    }
};
void mainmain(){
    int n;
    cin>>n;
    vvint wcost,ecost;
    initvv(ecost,n,n);
    initvv(wcost,n,n);
    rep(i,n) rep(j,n) cin>>wcost[i][j];
    rep(i,n) rep(j,n) cin>>ecost[i][j];
    vector<string> vs(n);
    rep(i,n) cin>>vs[i];
    MinCostFlow<int> mf;
    int start=2*n+1;
    int goal=2*n+2;
    rep(i,n){
        mf.addEdge(start,i,1,0);
        mf.addEdge(n+i,goal,1,0);
    }
    rep(i,n){
        int tt=0;
        rep(j,n) if(vs[i][j]=='o') tt+=ecost[i][j];
        rep(j,n){
            int t;
            if(vs[i][j]=='o'){
                t=tt-ecost[i][j];
            }
            else{
                t=tt+wcost[i][j];
            }
            mf.addEdge(i,n+j,1,t);
        }
    }
    int ans=mf.minCost(start,goal,n);
    vector<pair<pii,string>> tmp;
    rep(i,n){
        rep(j,n){
            bool f=false;
            for(auto x:mf.E[i]){
                if(x.capacity==0&&x.to==j+n) f=true;
            }
            if(vs[i][j]=='o'&&!f){
                tmp.PB(mkp(pii(i+1,j+1),"erase"));
            }
            if(vs[i][j]=='.'&&f){
                tmp.PB(mkp(pii(i+1,j+1),"write"));
            }
        }
    }
    cout<<ans<<endl;
    cout<<tmp.size()<<endl;
    rep(i,tmp.size()){
        cout<<tmp[i].F.F<<" "<<tmp[i].F.S<<" "<<tmp[i].S<<endl;
    }
    // cout<<mf.minCostFlow(start,goal,n)<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
    cout<<fixed<<setprecision(0);
    mainmain();
}

Measured memory_bytes: 1904