#include<bits/stdc++.h>
using namespace std;

// #define int long long
#define ls (p<<1)
#define rs (p<<1|1)
#define mid ((l+r)>>1)
#define all(_array) (_array).begin(),(_array).end()
#define msp(_array) memset(_array,0x3f,sizeof _array)
#define ms0(_array) memset(_array,0,sizeof _array)
#define msn(_array) memset(_array,-1,sizeof _array)
#define mc(_tar,_array) memcpy(_tar,_array,sizeof _tar)
#define Yes cout<<"Yes"<<endl,void()
#define No cout<<"0"<<endl,void()
#define YES cout<<"YES"<<endl,void()
#define NO cout<<"NO"<<endl,void()
#define yes cout<<"yes"<<endl,void()
#define no cout<<"no"<<endl,void()
#define TAK cout<<"TAK"<<endl,void()
#define NIE cout<<"NIE"<<endl,void()
#define OK cerr<<"OK"<<endl,void()
#define pii pair<int,int>
#define endl '\n'

bool bg_memory;
mt19937_64 rnd(time(0));
int Case=1;
const int mod=1e9+7;
const int inf=2147483647;
const int bs=233;
const double eps=1e-6;
const int N=2e3+7,M=1e5+7;

template<class _t1,class _t2>inline void cmax(_t1 &a,_t2 b){a=a<b?b:a;}
template<class _t1,class _t2>inline void cmin(_t1 &a,_t2 b){a=a>b?b:a;}
inline int qp(int a,int b,int p=mod){int res=1;while(b){if(b&1)res=1ll*res*a%p;a=1ll*a*a%p;b>>=1;}return res;}
inline int sqrt(int x,int r){int l=0,ans=0;while(l<=r){if(1ll*mid*mid<=x) ans=mid,l=mid+1;else r=mid-1;}return ans;}

int n;
char s[4][N];
int dp[N][N<<1][2],sum[N][N<<1][2];
int c[N<<1][N<<1];
int ans,plug;
int tot;
void solve(int l,int r){
    if(l>r) return;
    tot=0;
    sum[l-1][0][0]=1;
    if(l==1) for(int j=1;j<=3;j++) sum[l-1][j][0]=1;
    for(int i=l;i<=r;i++){
        int cnt=0;
        for(int j=1;j<=3;j++) if(s[j][i]=='x') cnt++;
        tot+=cnt;
        cnt--;
        for(int j=tot;j;j--){
            if(cnt==0){
                dp[i][j][0]=(sum[i-1][0][0]+sum[i-1][j][1])%mod;
                dp[i][j][1]=0;
            }
            if(cnt==1){
                dp[i][j][0]=(1ll*sum[i-1][0][0]*(j-1)%mod+1ll*sum[i-1][j-1][1]*(j-1)%mod)%mod;
                dp[i][j][1]=1ll*((sum[i-1][0][0]-sum[i-1][j][0])+mod)%mod*(tot-j)%mod;
            }
            if(cnt==2){
                dp[i][j][0]=(1ll*sum[i-1][0][0]*(j-1)%mod*(j-2)%mod+1ll*sum[i-1][j-2][1]*(j-1)%mod*(j-2)%mod)%mod;
                dp[i][j][1]=(1ll*((sum[i-1][0][0]-sum[i-1][j][0])+mod)%mod*(tot-j)%mod*(tot-j-1)%mod+2ll*((sum[i-1][0][0]-sum[i-1][j-1][0])+mod)%mod*(tot-j)%mod*(j-1)%mod)%mod;
            }
            // cout<<i<<" "<<j<<" "<<dp[i][j][0]<<" "<<dp[i][j][1]<<endl;
            sum[i][j][0]=(sum[i][j+1][0]+dp[i][j][0])%mod;
            sum[i][j][1]=(sum[i][j+1][1]+dp[i][j][1])%mod;
        }
        sum[i][0][0]=sum[i][1][0],sum[i][0][1]=sum[i][1][1];
    }
    plug+=tot;
    ans=1ll*(sum[r][0][0]+(r!=n?sum[r][0][1]:0))%mod*ans%mod*c[plug][tot]%mod;
}

void Main(){
    
    cin>>n;
    for(int i=0;i<=2*n;i++){
        c[i][0]=1;
        for(int j=1;j<=i;j++) c[i][j]=(c[i-1][j]+c[i-1][j-1])%mod;
    }
    for(int i=1;i<=3;i++) for(int j=1;j<=n;j++) cin>>s[i][j];
    for(int i=2;i<n;i++) if((s[1][i]=='x'&&s[1][i-1]=='x')||(s[3][i]=='x'&&s[3][i-1]=='x')) return No;
    if(s[1][1]=='x'||s[1][n]=='x'||s[3][1]=='x'||s[3][n]=='x') return No;
    int lst=0;
    ans=1;
    for(int i=1;i<=n+1;i++){
        if(s[2][i]=='x') continue;
        solve(lst+1,i-1);
        if(s[1][i]=='x') plug++,ans=1ll*ans*plug%mod;
        if(s[3][i]=='x') plug++,ans=1ll*ans*plug%mod;
        lst=i;
    }
    cout<<ans<<endl;

    return;
}
string RdFile="";
bool en_memory;

signed main(){
    auto bg_clock=chrono::high_resolution_clock::now();
#ifdef ONLINE_JUDGE
    // freopen((RdFile+".in").c_str(),"r",stdin);
    // freopen((RdFile+".out").c_str(),"w",stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // cin>>Case;
    while(Case--) Main();
    auto en_clock=chrono::high_resolution_clock::now();
    auto duration_clock=chrono::duration_cast<chrono::microseconds>(en_clock-bg_clock);
    double duration_count=duration_clock.count()*0.001;
    double memory_used=(&en_memory-&bg_memory)/1024.0/1024;
    // cerr<<"Time:"<<duration_count<<"ms"<<endl;
    // cerr<<"Memory: "<<memory_used<<"MB"<<endl;
    return 0;
}