#include <bits/stdc++.h>

using namespace std;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
int inf=1000000007;
ll infl=1000000000000000007;
ll mod=1000000007;
ll mod1=998244353;

const int N=2007;

char g[3][N];

ll fac[3*N];
ll inv[3*N];
 
ll pot(ll x,ll p) {ll res=1;for(;p;p>>=1) {if(p&1) res=res*x%mod; x=x*x%mod;} return res;}
ll npok(int n,int k)
{
    if(min(k,n)<0||k>n) return 0;
    return fac[n]*inv[k]%mod*inv[n-k]%mod;
}

void gg()
{
	cout<<0<<endl;
	exit(0);
}

int DP[N][3*N][2];
int P[N][3*N][2];
int S[N][3*N][2];
int t[N];

ll calc(vector<int>a)
{
	int n=sz(a);
	if(n==0) return 1;
	debug(a);
	DP[0][0][0]=1;
	S[0][0][0]=1;
	P[0][0][0]=1;
	ll ans=0;
	FOR(i,1,n)
	{
		t[i]=t[i-1]+a[i-1]+1;
		FOR(j,1,t[i])
		{
			if(a[i-1]==0)
			{
				DP[i][j][0]=((ll)P[i-1][t[i-1]][0]+(ll)S[i-1][j][1])%mod;
			}
			if(a[i-1]==1)
			{
				DP[i][j][0]=((ll)(j-1)*((ll)P[i-1][t[i-1]][0]+(ll)S[i-1][j-1][1]))%mod;
				DP[i][j][1]=((ll)P[i-1][j-1][0]*(t[i]-j))%mod;
			}
			if(a[i-1]==2)
			{
				if(j>1) DP[i][j][0]=((ll)(j-2)*(ll)(j-1)*((ll)P[i-1][t[i-1]][0]+(ll)S[i-1][j-2][1]))%mod;
				DP[i][j][1]=((ll)P[i-1][j-1][0]*(ll)(t[i]-j)*(ll)(t[i]-j-1))%mod;
				if(j>1) DP[i][j][1]=((ll)DP[i][j][1]+(ll)P[i-1][j-2][0]*2*(ll)(j-1)*(ll)(t[i]-j))%mod;
				
			}
			if(i==n) ans=(ans+(ll)DP[i][j][0]+(ll)DP[i][j][1])%mod;
		}
		FOR(l,0,1)
		{
			FOR(j,1,t[i]) P[i][j][l]=(P[i][j-1][l]+DP[i][j][l])%mod;
			ROF(j,t[i],0) S[i][j][l]=(S[i][j+1][l]+DP[i][j][l])%mod;
		}
	}
	FOR(i,0,n)
	{
		memset(DP[i],0,sizeof DP[i]);
		memset(P[i],0,sizeof P[i]);
		memset(S[i],0,sizeof S[i]);
	}
	debug(ans);
	return ans;
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    fac[0]=1;
    for(ll i=1;i<=3*n;i++) fac[i]=fac[i-1]*i%mod;
    inv[3*n]=pot(fac[3*n],mod-2);
    for(ll i=3*n-1;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
    FOR(j,0,2) 
    {
		FOR(i,1,n) cin>>g[j][i];
		if(j==1) continue;
		FOR(i,1,n) if(g[j][i]!='o'&&(g[j][i-1]!='o'||g[j][i+1]!='o')) gg();
	}
	ll ans=1;
	int free=0,tot=0,act=0,W=0;
	vector<int>V;
    FOR(i,1,n)
    {
		int C=(g[0][i]=='x')+(g[2][i]=='x');
		if(g[1][i]=='o')
		{
			free+=C;
			ans=ans*calc(V)%mod;
			W+=act;
			ans=ans*npok(W,act)%mod;
			act=0;
			V.clear();
		}
		else 
		{
			act+=C+1;
			V.pb(C);
		}
	}
	ans=ans*calc(V)%mod;
	W+=act;
	ans=ans*npok(W,act)%mod;
    ans=ans*npok(W+free,free)%mod*fac[free]%mod;
    debug(W,free);
    debug(npok(tot,free));
    cout<<ans<<endl;
    
    return 0;
}