#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

string grid[3];
constexpr ll mod = 1e9+7;
pair<int,int> poz[17];
ll dp[(1<<17)+9];

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    cin >> grid[0];
    cin >> grid[1];
    cin >> grid[2];
    int nr=0;
    for (int x=0;x<3;x++){
        for (int y=0;y<n;y++){
            if (grid[x][y]=='x'){
                poz[nr++]={x,y};
            }
        }
    }
    dp[(1<<nr)-1]=1;
    for (int mask=(1<<nr)-2;mask>=0;mask--){
        for (int x=0;x<nr;x++){
            if (mask&(1<<x))grid[poz[x].first][poz[x].second]='o';
        }
        for (int x=0;x<nr;x++){
            if (!(mask&(1<<x))){
                bool mozna=0;
                if (poz[x].first==1 && grid[0][poz[x].second]=='o' && grid[2][poz[x].second]=='o')mozna=1;
                if (poz[x].second>=1 && poz[x].second<n-1 && grid[poz[x].first][poz[x].second-1]=='o' && grid[poz[x].first][poz[x].second+1]=='o')mozna=1;
                if (mozna)dp[mask] = (dp[mask]+dp[mask | (1<<x)])%mod;
            }
        }
        for (int x=0;x<nr;x++){
            if (mask&(1<<x))grid[poz[x].first][poz[x].second]='x';
        }
    }
    cout << dp[0] << '\n';
}