/*
わんわん……わんだほーいっ☆
Wonderhoy!
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
char buf[1<<21],*p1=buf,*p2=buf;
#define getchar() (p1==p2 && (p2=(p1=buf)+fread(buf,1,1<<18,stdin),p1==p2)?EOF:*p1++)
int read()
{
    int x=0,f=1;
    char c=getchar();
    while(c<'0' || c>'9')    f=(c=='-'?-1:f),c=getchar();
    while(c>='0' && c<='9')    x=(x<<1)+(x<<3)+(c^'0'),c=getchar();
    return x*f;
}
void write(int x)
{
    if(x>9)    write(x/10);
    putchar(x%10+'0');
}
typedef pair<int,int> P;
typedef vector<int> Poly;
typedef vector<P> PolyP;
#define mp make_pair
#define spc putchar(' ')
#define etr putchar('\n')
#define inlp(x,y) putchar(x==y?'\n':' ')
const int MOD=998244353;
inline int Add(int u,int v){return u+v>=MOD?u+v-MOD:u+v;}
inline int Sub(int u,int v){return u-v>=0?u-v:u-v+MOD;}
inline int Mul(int u,int v){return LL(u)*LL(v)%MOD;}
inline int add(int &u,int v){return u=Add(u,v);}
inline int sub(int &u,int v){return u=Sub(u,v);}
inline int mul(int &u,int v){return u=Mul(u,v);}
int QuickPow(int x,int p=MOD-2)
{
    int ans=1,base=x;
    while(p)
    {
        if(p&1)    mul(ans,base);
        mul(base,base);
        p>>=1;
    }
    return ans;
}
int readSign()
{
	char c=getchar();
	while(c!='-' && c!='+')	c=getchar();
	return c=='+'?1:-1;
}
int n;
int a[4005][4005];
int r[4005],c[4005];
int occ[4005][4005];
void choose(int x,int y)
{
	int w=a[x][y];
	a[x][y]=-a[x][y];
	r[x]+=w,c[y]+=w;
	occ[x][y]^=1;
}
int id[4005];
int main(){
	n=read();
	for(int i=1;i<=n;++i)	for(int j=1;j<=n;++j)	a[i][j]=readSign();
	int chk0=0;
	for(int i=1;i<=n;++i)	r[i]=-read(),chk0+=r[i];
	for(int i=1;i<=n;++i)	c[i]=-read(),chk0-=c[i];
//	write(chk0),etr;
	if(chk0)	return puts("NO")&0;
	for(int i=1;i<=n;++i)	for(int j=1;j<=n;++j)	if(a[i][j]==1)	choose(i,j);
	for(int i=1;i<=n;++i)	if(r[i]<0 || r[i]>n || c[i]<0 || c[i]>n)	return puts("no")&0;
	for(int i=1;i<=n;++i)	id[i]=i;
	for(int i=1;i<=n;++i)
	{
		sort(id+1,id+1+n,[&](int x,int y){return c[x]>c[y];});
		int p=r[i];
		for(int j=1;j<=p;++j)
		{
			choose(i,id[j]);
			if(r[i]<0 || c[id[j]]<0)	return puts("No")&0;
		}
	}
	puts("Yes");
	for(int i=1;i<=n;++i)
	{
		for(int j=1;j<=n;++j)	putchar('0'^occ[i][j]);
		etr;
	}
	
    return 0;
}