using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
static class Program{
	const int mod=(int)1e9+7;
	static void Main(){
		Sc sc=new Sc();
		var n=sc.I;
		var a=sc.Arr(n,()=>sc.Ia);
		var b=sc.Arr(n,()=>sc.Ia);
		var t=sc.Arr(n,()=>sc.S);
		int ans=0;
		for(int i = 0;i<n;i++) {
			for(int j = 0;j<n;j++) {
				if(t[i][j]=='o'){ans+=b[i][j];}
			}
		}
		int g=n*2+1;
		var fl=new Mcfp(g+1,n*n+n*2);
		for(int i = 0;i<n;i++) {
			fl.Edge(g-1,i,1,0);
			fl.Edge(n+i,g,1,0);
			for(int j = 0;j<n;j++) {
				int c=t[i][j]!='o'?a[i][j]:-b[i][j];
				fl.Edge(i,n+j,1,c);
			}
		}
		Console.WriteLine("{0}",ans+fl.Pd2(g-1,g,n));
		int z=0;
		StringBuilder sb=new StringBuilder();
		fl.Th((v1,v2)=>{
			if(v1!=g-1&&v2!=g){
				if(t[v1][v2-n]!='o'){
					z++;
					sb.Append(v1+1).Append(" ").Append(v2-n+1).Append(" write\n");
				}
				a[v1][v2-n]=-1;
			}
		});
		for(int i = 0;i<n;i++) {
			for(int j = 0;j<n;j++) {
				if(t[i][j]=='o'&&a[i][j]!=-1){
					z++;
					sb.Append(i+1).Append(" ").Append(j+1).Append(" erase\n");
				}
			}
		}
		Console.WriteLine("{0}",z);
		Console.Write(sb);
	}
}
public class Mcfp{
	private List<int>[] li;
	private int[][] h,pt;
	private int[] z,l,r,u;
	private bool[] b1,b2;
	private int n,p=0;
	private const int inf=int.MaxValue;
	public Mcfp(int n,int m){
		this.n=n;
		m<<=1;
		li=new List<int>[n];
		z=new int[n];
		l=new int[n];
		r=new int[n];
		u=new int[n];
		h=new int[m][];
		for(int i=0;i<n;i++){
			li[i]=new List<int>();
			z[i]=int.MaxValue;
		}
	}
	public void Edge(int a,int b,int e,int c){
		if(a==b){return;}
		li[a].Add(p);
		li[b].Add(p+1);
		h[p]=new int[]{b,e,c};
		h[p+1]=new int[]{a,0,-c};
		p+=2;
	}
	public void Th(Action<int,int> f){
		for(int i = 0;i<h.Length;i+=2) {
			if(h[i+1][1]!=0){f(h[i+1][0],h[i][0]);}
		}
	}
	public long Pd2(int s,int t,int c){
		long ans=0,d=0;
		for(int i=0;i<n;i++){
			z[i]=int.MaxValue;
			u[i]=int.MaxValue;
		}
		z[s]=0;
		l[s]=-1;
		b1=new bool[n];
		pt=new int[][]{new int[n],new int[n]};
		int m=h.Length;
		bool bo=true;
		for(int i=0;bo&&i<n;i++){
			bo=false;
			for(int j=0;j<m;j++){
				if(h[j][1]!=0&&z[h[j^1][0]]!=int.MaxValue&&z[h[j][0]]>z[h[j^1][0]]+h[j][2]){
					z[h[j][0]]=z[h[j^1][0]]+h[j][2];
					pt[0][h[j][0]]=z[h[j][0]];
					l[h[j][0]]=h[j^1][0];
					r[h[j][0]]=j;
					u[h[j][0]]=Min(u[h[j^1][0]],h[j][1]);
					bo=true;
					if(i==n){b1[h[j][0]]=true;}
				}
			}
		}
		u[t]=(int)Min(c-d,u[t]);
		for(int i = t;i!=s;i=l[i]) {
			ans+=u[t]*h[r[i]][2];
			h[r[i]][1]-=u[t];
			h[r[i]^1][1]+=u[t];
		}
		d+=u[t];
		int k=1;
		if(c==d){return ans;}
		while(c>d){
			b1=new bool[n];
			b2=new bool[n];
			u=new int[n];
			var pq=new Pq<Mo<int>>(32,true);
			z[s]=0;
			l[s]=-1;
			u[s]=int.MaxValue;
			b2[s]=true;
			pq.Push(new Mo<int>(0,s));
			bo=false;
			while(pq.cnt>0){
				var e=pq.Top;
				pq.Pop();
				if(b1[e.d]){continue;}
				b1[e.d]=true;
				if(e.d==t){bo=true;}
				for(int i=0;i<li[e.d].Count;i++){
					if(h[li[e.d][i]][1]==0){continue;}
					int co=e.n+h[li[e.d][i]][2]-pt[k^1][h[li[e.d][i]][0]]+pt[k^1][e.d];
					if(!b2[h[li[e.d][i]][0]]||z[h[li[e.d][i]][0]]>co){
						b2[h[li[e.d][i]][0]]=true;
						z[h[li[e.d][i]][0]]=co;
						pt[k][h[li[e.d][i]][0]]=pt[k^1][h[li[e.d][i]][0]]+co;
						l[h[li[e.d][i]][0]]=e.d;
						r[h[li[e.d][i]][0]]=li[e.d][i];
						u[h[li[e.d][i]][0]]=Min(u[e.d],h[li[e.d][i]][1]);
						pq.Push(new Mo<int>(z[h[li[e.d][i]][0]],h[li[e.d][i]][0]));
					}
					else if(z[h[li[e.d][i]][0]]==co){
						var o=Min(u[e.d],h[li[e.d][i]][1]);
						if(u[h[li[e.d][i]][0]]<o){
							u[h[li[e.d][i]][0]]=o;
							l[h[li[e.d][i]][0]]=e.d;
							r[h[li[e.d][i]][0]]=li[e.d][i];
						}
					}
				}
			}
			if(!bo){break;}
			u[t]=(int)Min(c-d,u[t]);
			for(int i = t;i!=s;i=l[i]) {
				ans+=u[t]*h[r[i]][2];
				h[r[i]][1]-=u[t];
				h[r[i]^1][1]+=u[t];
			}
			k^=1;
			d+=u[t];
		}
		return c==d?ans:-1;
	}
	public long Pd(int s,int t,int c){
		long ans=0,d=0;
		pt=new int[][]{new int[n],new int[n]};
		int k=0;
		while(c>d){
			b1=new bool[n];
			b2=new bool[n];
			u=new int[n];
			var pq=new Pq<Mo<int>>(32,true);
			z[s]=0;
			l[s]=-1;
			u[s]=int.MaxValue;
			b2[s]=true;
			pq.Push(new Mo<int>(0,s));
			bool bo=false;
			while(pq.cnt>0){
				var e=pq.Top;
				pq.Pop();
				if(b1[e.d]){continue;}
				b1[e.d]=true;
				if(e.d==t){bo=true;}
				for(int i=0;i<li[e.d].Count;i++){
					if(h[li[e.d][i]][1]==0){continue;}
					int co=e.n+h[li[e.d][i]][2]-pt[k^1][h[li[e.d][i]][0]]+pt[k^1][e.d];
					if(!b2[h[li[e.d][i]][0]]||z[h[li[e.d][i]][0]]>co){
						b2[h[li[e.d][i]][0]]=true;
						z[h[li[e.d][i]][0]]=co;
						pt[k][h[li[e.d][i]][0]]=pt[k^1][h[li[e.d][i]][0]]+co;
						l[h[li[e.d][i]][0]]=e.d;
						r[h[li[e.d][i]][0]]=li[e.d][i];
						u[h[li[e.d][i]][0]]=Min(u[e.d],h[li[e.d][i]][1]);
						pq.Push(new Mo<int>(z[h[li[e.d][i]][0]],h[li[e.d][i]][0]));
					}
					else if(z[h[li[e.d][i]][0]]==co){
						var o=Min(u[e.d],h[li[e.d][i]][1]);
						if(u[h[li[e.d][i]][0]]<o){
							u[h[li[e.d][i]][0]]=o;
							l[h[li[e.d][i]][0]]=e.d;
							r[h[li[e.d][i]][0]]=li[e.d][i];
						}
					}
				}
			}
			if(!bo){break;}
			u[t]=(int)Min(c-d,u[t]);
			for(int i = t;i!=s;i=l[i]) {
				ans+=u[t]*h[r[i]][2];
				h[r[i]][1]-=u[t];
				h[r[i]^1][1]+=u[t];
			}
			k^=1;
			d+=u[t];
		}
		return c==d?ans:-1;
	}
}
public class Mo<T>:IComparable{
	public int n;
	public T d;
	public Mo(int n,T d){this.n=n;this.d=d;}
	public int CompareTo(object obj){
		Mo<T> mymo=(Mo<T>)obj;
		if(mymo.n>n){return -1;}
		else if(mymo.n<n){return 1;}
		else{return 0;}
	}
}
public class Pq<T> where T:IComparable{
	private T[] he;
	public int cnt=0,max=0;
	private Func<T,T,int> compare;
	public Pq(int max,bool mm){
		this.max=max;
		he=new T[max];
		if(mm){compare=Ao;}
		else{compare=Do;}
	}
	public void Push(T x){
		if(cnt==max){Extend();}
		int j=cnt;
		while(j!=0&&compare(x,he[(j-1)>>1])>0){he[j]=he[(j-1)>>1];j=(j-1)>>1;}
		he[j]=x;
		cnt++;
	}
	public void Pop(){
		cnt--;
		T r=he[cnt];
		int j=0;
		while(true){
			if(j*2+1<cnt){
				if(compare(he[j*2+1],he[j*2+2])>0){j=j*2+1;}
				else{j=j*2+2;}
			}
			else if(j*2<cnt){j=j*2+1;}
			else{break;}
			if(compare(he[j],r)<=0){j=(j-1)>>1;break;}
			he[(j-1)>>1]=he[j];
		}
		he[j]=r;
	}
	private int Ao(T x,T y){return y.CompareTo(x);}
	private int Do(T x,T y){return x.CompareTo(y);}
	public T Top{get{return he[0];}}
	private void Extend(){
		T[] nhe=new T[max<<1];
		Array.Copy(he,nhe,max);
		he=nhe;
		max<<=1;
	}
}

public class Sc{
	private string[] a;
	private int n=-1,m=0;
	public int I{get{if(n==-1||n==a.Length-1){n=-1;a=Console.ReadLine().Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries);}n++;return int.Parse(a[n]);}}
	public long L{get{if(n==-1||n==a.Length-1){n=-1;a=Console.ReadLine().Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries);}n++;return long.Parse(a[n]);}}
	public double D{get{if(n==-1||n==a.Length-1){n=-1;a=Console.ReadLine().Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries);}n++;return double.Parse(a[n]);}}
	public string S{get{if(n==-1||n==a.Length-1){n=-1;a=Console.ReadLine().Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries);}n++;return a[n];}}
	public int[] Ia{get{if(n!=-1&&n!=a.Length-1){m=n;n=-1;return Array.ConvertAll(a.Skip(m+1).ToArray(),int.Parse);}return Array.ConvertAll(Console.ReadLine().Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries),int.Parse);}}
	public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries),long.Parse);}}
	public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries),double.Parse);}}
	public string[] Sa{get{return Console.ReadLine().Split(new string[]{" ","　","	"},StringSplitOptions.RemoveEmptyEntries);}}
	public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
	public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}
	public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
	public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}


Measured memory_bytes: 23480