1 /**************************************************************
  2     Problem: 3504
  3     User: Tunix
  4     Language: C++
  5     Result: Accepted
  6     Time:44 ms
  7     Memory:2500 kb
  8 ****************************************************************/
  9  
 10 //BZOJ 3504
 11 #include<vector>
 12 #include<cstdio>
 13 #include<cstring>
 14 #include<cstdlib>
 15 #include<iostream>
 16 #include<algorithm>
 17 #define rep(i,n) for(int i=0;i<n;++i)
 18 #define F(i,j,n) for(int i=j;i<=n;++i)
 19 #define D(i,j,n) for(int i=j;i>=n;--i)
 20 #define pb push_back
 21 using namespace std;
 22 inline int getint(){
 23     int v=0,sign=1; char ch=getchar();
 24     while(ch<‘0‘||ch>‘9‘){ if (ch==‘-‘) sign=-1; ch=getchar();}
 25     while(ch>=‘0‘&&ch<=‘9‘){ v=v*10+ch-‘0‘; ch=getchar();}
 26     return v*sign;
 27 }
 28 const int N=3010,M=1e5+10,INF=~0u>>2;
 29 typedef long long LL;
 30 /******************tamplate*********************/
 31 int n,m,tot,ans,a1,a2,an,b1,b2,bn;
 32 char mp[55][55];
 33 struct edge{int to,v;};
 34 struct Net{
 35     edge E[M];
 36     int head[N],next[M],cnt;
 37     void ins(int x,int y,int v){
 38         E[++cnt]=(edge){y,v};
 39         next[cnt]=head[x]; head[x]=cnt;
 40     }
 41     void add(int x,int y,int v){
 42         ins(x,y,v); ins(y,x,0);
 43     }
 44     int s,t,cur[N],d[N],Q[N];
 45     bool mklevel(){
 46         memset(d,-1,sizeof d);
 47         d[s]=0;
 48         int l=0,r=-1;
 49         Q[++r]=s;
 50         while(l<=r){
 51             int x=Q[l++];
 52             for(int i=head[x];i;i=next[i])
 53                 if (d[E[i].to]==-1 && E[i].v){
 54                     d[E[i].to]=d[x]+1;
 55                     Q[++r]=E[i].to;
 56                 }
 57         }
 58         return d[t]!=-1;
 59     }
 60     int dfs(int x,int a){
 61         if (x==t) return a;
 62         int flow=0;
 63         for(int &i=cur[x];i && flow<a;i=next[i])
 64             if (E[i].v && d[E[i].to]==d[x]+1){
 65                 int f=dfs(E[i].to,min(a-flow,E[i].v));
 66                 E[i].v-=f;
 67                 E[i^1].v+=f;
 68                 flow+=f;
 69             }
 70         if (!flow) d[x]=-1;
 71         return flow;
 72     }
 73     void Dinic(){
 74         while(mklevel()){ 
 75             F(i,s,t) cur[i]=head[i];
 76             ans+=dfs(s,INF);
 77         }
 78     }
 79     void init(){
 80         s=0; t=n+1; cnt=1; ans=0;
 81         memset(head,0,sizeof head);
 82         F(i,1,n){
 83             scanf("%s",mp[i]+1);
 84             F(j,1,n){
 85                 if (mp[i][j]==‘N‘) add(i,j,INF);
 86                 else if (mp[i][j]==‘O‘) add(i,j,2);
 87             }
 88         }
 89         add(s,a1+1,an*2); add(a2+1,t,an*2);
 90         add(s,b1+1,bn*2); add(b2+1,t,bn*2);
 91         Dinic();
 92         if (ans==an*2+bn*2){
 93             cnt=1; memset(head,0,sizeof head);
 94             F(i,1,n) F(j,1,n){
 95                 if (mp[i][j]==‘N‘) add(i,j,INF);
 96                 else if (mp[i][j]==‘O‘) add(i,j,2);
 97             }
 98             add(s,a1+1,an*2); add(a2+1,t,an*2);
 99             add(s,b2+1,bn*2); add(b1+1,t,bn*2);
100             ans=0; Dinic();
101             if (ans==an*2+bn*2) puts("Yes");
102             else puts("No");
103         }else puts("No");
104     }
105 }G1;
106  
107 int main(){
108 #ifndef ONLINE_JUDGE
109     freopen("3504.in","r",stdin);
110     freopen("3504.out","w",stdout);
111 #endif
112     while(scanf("%d%d%d%d%d%d%d",&n,&a1,&a2,&an,&b1,&b2,&bn)!=EOF)
113         G1.init();
114     return 0;
115 }