#include<bits/stdc++.h>
#define int long long
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define popc __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef unsigned long long ull;
typedef long double ld;

int read() {
	int x=0,w=1; char c=getchar(); 
	while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
	while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
	return x*w;
}

const int N=2009,mod=1e9+7;
int n,f[N][N*3][2],h[N][N*3][2],p[N],tot,sz[N],g[N],fac[N*3],ifac[N*3],ans,sm;
char s[3][N];

int ksm(int x,int y,int r=1) {
	for(;y;y>>=1,x=x*x%mod) if(y&1) r=r*x%mod;
	return r;
}

void re0() {puts("0"); exit(0);}
int sum(int x,int l,int r,int t) {return h[x][max(0ll,r)][t]-h[x][max(0ll,l-1)][t];}

signed main() {
	n=read(); rep(i,0,2) scanf("%s",s[i]+1);
	fac[0]=ifac[0]=1; rep(i,1,n*3) fac[i]=fac[i-1]*i%mod;
	ifac[n*3]=ksm(fac[n*3],mod-2); per(i,n*3-1,1) ifac[i]=ifac[i+1]*(i+1)%mod;
	rep(i,1,n) {
		if(s[0][i]!='o'&&!(s[0][i-1]=='o'&&s[0][i+1]=='o')) re0();
		if(s[2][i]!='o'&&!(s[2][i-1]=='o'&&s[2][i+1]=='o')) re0();
		if(s[1][i]=='x') {
			int x=(s[0][i]=='o')+(s[2][i]=='o'); p[i]=p[i-1]+(3-x);
			if(s[1][i-1]!='x') {
				if(x==2) f[i][1][0]=1;
				else if(x==1) f[i][2][0]=1, f[i][1][1]=(i!=1);
				else f[i][3][0]=2, f[i][1][1]=f[i][2][1]=2*(i!=1);
			} else {
				rep(j,1,p[i]) {
					if(x==2) f[i][j][0]=(sum(i-1,1,3*n,0)+sum(i-1,j,3*n,1))%mod;
					else if(x==1) {
						f[i][j][0]=(j-1)*(sum(i-1,1,3*n,0)+sum(i-1,j-1,3*n,1))%mod;
						f[i][j][1]=(p[i]-j)*sum(i-1,1,j-1,0)%mod;
					} else {
						f[i][j][0]=(j-1)*(j-2)%mod*(sum(i-1,1,3*n,0)+sum(i-1,j-2,3*n,1))%mod;
						f[i][j][1]=(2*(j-1)*(p[i]-j)%mod*sum(i-1,1,j-2,0)
											 +(p[i]-j)*(p[i]-j-1)%mod*sum(i-1,1,j-1,0))%mod;
					}
				}
			}
			rep(j,1,n*3) rep(t,0,1) h[i][j][t]=(h[i][j-1][t]+f[i][j][t])%mod;
			if(s[1][i+1]!='x') {
				++tot; sz[tot]=p[i]; g[tot]=(h[i][n*3][0]+(i!=n)*h[i][n*3][1])%mod;
			}
		} else {
			int x=(s[0][i]=='x')+(s[2][i]=='x');
			++tot; sz[tot]=x, g[tot]=fac[x];
		}
	}
	rep(i,1,tot) sm+=sz[i]; ans=fac[sm];
	rep(i,1,tot) ans=ans*ifac[sz[i]]%mod*g[i]%mod;
	printf("%lld\n",(ans+mod)%mod);
	return 0;
}