#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n,s,t;
int G[8005][8005];
char S[4005][4005];
int a[4005];

int dis[8005],cur[8005];
queue <int> Q;
int bfs(){
	memset(dis,0x3f,sizeof(dis));
	dis[s] = 0;
	Q.push(s);
	while(!Q.empty()){
		int u = Q.front();
		Q.pop();
		rep(v,0,2 * n + 1){
			if(G[u][v] && dis[v] > dis[u] + 1){
				dis[v] = dis[u] + 1;
				Q.push(v);
			}
		}
	}
	return dis[t] != inf;
}

int dfs(int u,int flow){
	if(u == t || !flow) return flow;
	int sum = 0,tmp;
	for(int v = cur[u];v <= 2 * n + 1;v = cur[u]){
		cur[u] = v + 1;
		if(!G[u][v] || dis[v] != dis[u] + 1) continue;
		tmp = dfs(v,min(flow,G[u][v]));
		G[u][v] -= tmp;
		G[v][u] += tmp;
		flow -= tmp;
		sum += tmp;
		if(!flow) return sum;
	}
	return sum;
}
int dinic(){
	int ans = 0;
	while(bfs()){
		fill(cur,cur + 2 * n + 1,0);
		ans += dfs(s,inf);
	}
	return ans;
}

int main(){
//	freopen("test.in","r",stdin);
	scanf("%d",&n);
	rep(i,1,n){
		scanf("%s",S[i] + 1);
		rep(j,1,n){
			if(S[i][j] == '+') G[i][j + n] = 1;
			else G[j + n][i] = 1;
		}
	}
	int sum1 = 0,sum2 = 0;
	s = 0;t = 2 * n + 1;
	rep(i,1,n){
		scanf("%d",&a[i]);
		if(a[i] > 0){
			G[s][i] = a[i];
			sum1 += a[i];
		}else{
			G[i][t] = -a[i];
			sum2 -= a[i];
		}
	}
	rep(i,1,n){
		scanf("%d",&a[i]);
		a[i] *= -1;
		if(a[i] > 0){
			G[s][i + n] = a[i];
			sum1 += a[i];
		}else{
			G[i + n][t] = -a[i];		
			sum2 -= a[i];
		}
	}
//	rep(u,0,2 * n + 1){
//		rep(v,0,2 * n + 1) if(G[u][v]) printf("%d->%d %d\n",u,v,G[u][v]);
//	}
	if(sum1 != sum2){
		printf("No\n");
		return 0;
	}
	int ret = dinic();
/*	printf("Remaining:\n");
	rep(u,0,2 * n + 1){
		rep(v,0,2 * n + 1) if(G[u][v]) printf("%d->%d %d\n",u,v,G[u][v]);
	}*/
	if(ret != sum1){
		printf("No\n");
		return 0;
	}
	printf("Yes\n");
	rep(u,1,n){
		rep(v,n + 1,2 * n){
			if(S[u][v - n] == '+') printf("%d",G[u][v] ^ 1);
			else printf("%d",G[v][u] ^ 1);
		}
		printf("\n");
	}
	return 0;
}