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

#define int long long
const int mod = 1e9+7;
const int mn = 2003;
int n;
char t[5][mn];
int dp[1<<20];
vector<pair<int,int>> puste;

bool czy(int msk, int i, int j){
    for (int k = 0; k < puste.size(); k++){
        if (msk&(1<<k)){
            t[puste[k].first][puste[k].second] = 'o';
        }
    }
    bool wyn = 0;
    if ((t[i-1][j] == 'o' && t[i+1][j] == 'o') || (t[i][j-1] == 'o' && t[i][j+1] == 'o')) wyn = 1;
    for (int k = 0; k < puste.size(); k++){
        if (msk&(1<<k)){
            t[puste[k].first][puste[k].second] = 'x';
        }
    }
    return wyn;
}

int32_t main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin>>n;
    for (int i = 1; i <= 3; i++){
        for (int j = 1; j <= n; j++){
            cin>>t[i][j];
            if (t[i][j] == 'x') puste.push_back({i, j});
        }
    }
    dp[0] = 1;
    for (int i = 1; i < (1<<puste.size()); i++){
        for (int j = 0; j < puste.size(); j++){
            if (i&(1<<j) && czy(i-(1<<j), puste[j].first, puste[j].second)) dp[i] = (dp[i] + dp[i-(1<<j)])%mod;
        }
    }
    cout<<dp[(1<<puste.size())-1]<<"\n";
}