#include<bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
#define rep(a, b) for(ll a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const ll LIM=2e3+7, MOD=1e9+7;
ll dp[LIM][LIM][2], pref[LIM][LIM][2], sil[3*LIM], osil[3*LIM];
string S[3];
ll pot(ll a, ll b) {
  ll ans=1;
  while(b) {
    if(b&1) ans=(ans*a)%MOD;
    a=(a*a)%MOD;
    b/=2;
  }
  return ans;
}
ll C(ll n, ll k) {
  if(k>n || n<0) return 0;
  return (((sil[n]*osil[k])%MOD)*osil[n-k])%MOD;
}
ll licz(ll a, ll b, ll x, ll y) {
  if(a>b) return 0;
  return (pref[x][b][y]-pref[x][a-1][y]+MOD)%MOD;
}

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);
  sil[0]=osil[0]=1;
  for(ll i=1; i<3*LIM; ++i) {
    sil[i]=(sil[i-1]*i)%MOD;
    osil[i]=pot(sil[i], MOD-2);
  }
  ll n;
  cin >> n;
  rep(i, 3) {
    cin >> S[i];
    S[i]="x"+S[i]+"x";
  }
  rep(i, n+1) if(S[0][i]=='x' && S[0][i+1]=='x' || S[2][i]=='x' && S[2][i+1]=='x') {
    cout << 0 << '\n';
    return 0;
  }
  ll ile=0;
  for(ll i=1; i<=n; ++i) if(S[1][i]=='o') {
    if(S[0][i]=='x') ++ile;
    if(S[2][i]=='x') ++ile;
  }
  ll ans=sil[ile], lst=1, sum=0;
  for(ll i=1; i<=n+1; ++i) {
    if(S[1][i]=='o' || i>n) {
      if(lst!=i) {
        ll x=0;
        for(ll k=1; k<=sum; ++k) x=(x+dp[i-1][k][0])%MOD;
        if(i<=n) {
          for(ll k=1; k<=sum; ++k) x=(x+dp[i-1][k][1])%MOD;
        }
        ans=(ans*x)%MOD;
        ile+=sum;
        ans=(ans*C(ile, sum))%MOD;
      }
      lst=i+1;
      sum=0;
    } else {
      ll akt=1;
      if(S[0][i]=='x') ++akt;
      if(S[2][i]=='x') ++akt;
      sum+=akt;
      for(ll j=1; j<=sum; ++j) {
        rep(l, 2) pref[i-1][j][l]=(pref[i-1][j-1][l]+dp[i-1][j][l])%MOD;
      }
      if(lst==i) {
        dp[i][akt][0]=sil[akt-1];
        if(i!=1) {
          if(akt>1) dp[i][1][1]=sil[akt-1];
          if(akt>2) dp[i][2][1]=sil[akt-1];
        }
        continue;
      }
      for(ll k=1; k<=sum; ++k) {
        // licze dp[i][k][0]
        ll x=0;
        x=licz(1, sum, i-1, 0);
        //for(ll j=1; j<=sum; ++j) x=(x+dp[i-1][j][0])%MOD;
        x=(x+licz(k-akt+1, sum, i-1, 1))%MOD;
        //for(ll j=k-akt+1; j<=sum; ++j) x=(x+dp[i-1][j][1])%MOD;
        x=(x*C(k-1, akt-1))%MOD;
        x=(x*sil[akt-1])%MOD;
        dp[i][k][0]=(dp[i][k][0]+x)%MOD;
      }
      if(akt>=2) {
        for(ll k=1; k<=sum; ++k) {
          // licze czesc dp[i][k][1]
          ll x=0;
          x=licz(1, k-1, i-1, 0);
          //for(ll j=1; j<k; ++j) x=(x+dp[i-1][j][0])%MOD;
          x=(x*C(sum-k, akt-1))%MOD;
          x=(x*sil[akt-1])%MOD;
          dp[i][k][1]=(dp[i][k][1]+x)%MOD;
        }
      }
      if(akt==3) {
        for(ll k=1; k<=sum; ++k) {
          // licze druga czesc dp[i][k][1]
          ll x=0;
          x=licz(1, k-2, i-1, 0);
          //for(ll j=1; j<k-1; ++j) x=(x+dp[i-1][j][0])%MOD;
          x=(x*C(k-1, 1))%MOD;
          x=(x*C(sum-k, 1))%MOD;
          x=(x*2)%MOD;
          dp[i][k][1]=(dp[i][k][1]+x)%MOD;
        }
      }
    }
  }
  cout << ans << '\n';
}