// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}
// modint
#define mod 1000000007
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n;
string s[3];
int c[maxn];

modint f[2005][6005][2];

void work()
{
	n=read();
	cin>>s[0]>>s[1]>>s[2];
	For(i,0,2)
		For(j,0,n-1) s[i][j]=(s[i][j]=='o');
	if(!s[0][0]||!s[0][n-1]||!s[2][0]||!s[2][n-1]){
		puts("0");
		return;
	}
	For(i,0,n-2){
		if(!s[0][i] && !s[0][i+1]) {
			puts("0");
			return;
		}
		if(!s[2][i] && !s[2][i+1]) {
			puts("0");
			return;
		}
	}
	int mx=0,cnt=0;
	modint res=1;
	For(i,0,n)For(j,0,n*3)f[i][j][0]=f[i][j][1]=0;
	f[0][0][0]=1;
	For(i,0,2)For(j,0,n-1)cnt+=(!s[i][j]);
	For(i,1,n){
		bool bo=s[1][i-1];
		int c=(!s[0][i-1])+(!s[2][i-1]);
		if(bo){
			modint sum=0;
			For(j,0,mx)sum+=f[i-1][j][0];
			res*=sum;
			f[i][0][0]=1,mx=0;
			continue;
		}
		// 确定顺序，是被限制的 第 j 个放 
		For(j,0,mx){
			f[i][c+1][0]+=f[i-1][j][0]*iv[c+1];
			f[i][j+c+1][0]+=f[i-1][j][1]*iv[j+c+1];
			modint s=f[i-1][j][0]+f[i-1][j][1];
			f[i][j+1][0]+=s*iv[j+1];
			f[i][j+1][1]-=s*iv[j+1];
			f[i][j+c+1][1]+=s*iv[j+c+1];
			f[i][j+c+1][0]-=s*iv[j+c+1]; 
		}
		mx+=c+1;
	}
	modint sum=0;
	For(j,0,mx) sum+=f[n][j][0]+f[n][j][1];
	res*=sum;
	res*=fac[cnt];
	cout<<res.x<<'\n';
}

signed main()
{
	initC(10005);
	int T=1;
	while(T--)work();
	return 0;
}
/*
114
5
oxoxo
xxoxx
oooxo
5
oxoxo
xxoxx
oooxo
*/