#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1<<20;
string tab[N];
ll dp[N];
pair<int, int> fre[N];

bool Chk(pair<int, int> a, int n, int m)
{
    if(a.st != 1 && a.st != n)
        if(tab[a.st - 1][a.nd] == 'o' && tab[a.st + 1][a.nd] == 'o')
            return true;
    if(a.nd != 1 && a.nd != m)
        if(tab[a.st][a.nd - 1] == 'o' && tab[a.st][a.nd + 1] == 'o')
            return true;
    return false;
}

void Solve()
{
    int n, m, l = 0;
    cin >> m; n = 3;
    for(int i = 1; i <= n; ++i)
    {
        cin >> tab[i]; tab[i] = '#' + tab[i];
        for(int j = 1; j <= m; ++j)
            if(tab[i][j] == 'x')
            {
                fre[l] = make_pair(i, j);
                ++l;
            }
    }
    dp[0] = 1LL;
    for(int i = 1; i < (1<<l); ++i)
    {
        for(int j = 0; j < l; ++j)
            if((1<<j) & i) tab[fre[j].st][fre[j].nd] = 'o';
        for(int j = 0; j < l; ++j)
        {
            if(!((1<<j) & i)) continue;
            if(Chk(fre[j], n, m))
                dp[i] += dp[i ^ (1<<j)];
        }
        dp[i] %= M;
        for(int j = 0; j < l; ++j)
            if((1<<j) & i) tab[fre[j].st][fre[j].nd] = 'x';
    }
    cout << dp[(1<<l) - 1] << "\n";
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //int t; cin >> t;
    //while(t--)
        Solve();

    return 0;
}