#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 = 2000 + 7;
ll sil[3 * N], osil[3 * N];
ll dp[2][N][3 * N];

ll QP(ll a, ll n)
{
    ll ans = 1LL;
    while(n > 0LL)
    {
        if(n % 2LL == 1LL) ans = (ans * a) % M;
        a = (a * a) % M;
        n /= 2LL;
    }
    return ans;
}

void PreSil(int n)
{
    sil[0] = 1LL;
    for(int i = 1; i <= n; ++i) sil[i] = (sil[i - 1] * (ll)i) % M;
    osil[n] = QP(sil[n], M - 2LL);
    for(int i = n - 1; i >= 0; --i) osil[i] = (osil[i + 1] * (ll)(i + 1)) % M;
}

inline ll NK(int n, int k)
{
    return (((sil[n] * osil[k]) % M) * osil[n - k]) % M;
}

string tab[4], itab[4];

void Construct(int i, int j)
{
    tab[1].clear(); tab[2].clear(); tab[3].clear();
    tab[1].pb('x'); tab[2].pb('x'); tab[3].pb('x');
    for(int l = i; l <= j; ++l)
    {
        tab[1].pb(itab[1][l]);
        tab[2].pb(itab[2][l]);
        tab[3].pb(itab[3][l]);
    }
}

void StDP(int n, bool st)
{
    int il = 0;
    for(int i = 1; i <= 3 * n; ++i)
    {
        dp[0][1][i] = 0;
        dp[1][1][i] = 0;
    }
    if(tab[1][1] == 'x') ++il;
    if(tab[3][1] == 'x') ++il;
    dp[0][1][il + 1] = sil[il];
    if(!st && il > 0)
    {
        dp[1][1][1] = sil[il];
        if(il > 1)
            dp[1][1][2] = sil[il];
    }
}

pair<ll, int> LiczDP(int n, bool st, bool en)
{
    int il = 0, m = 1; ll ans = 0LL;

    StDP(n, st);

    if(tab[1][1] == 'x') ++m;
    if(tab[3][1] == 'x') ++m;

    for(int i = 2; i <= n; ++i)
    {
        //cout << "\n";
        for(int j = 1; j <= 3 * n; ++j)
        {
            dp[0][i][j] = 0LL;
            dp[1][i][j] = 0LL;
        }
        il = 0;
        if(tab[1][i] == 'x') ++il;
        if(tab[3][i] == 'x') ++il;
        ll cur = sil[il], s = 0LL;
        for(int j = 1; j <= m; ++j)
            s += dp[0][i - 1][j];
        //cout << "f s, cur: " << s << " " << cur << "\n";
        s %= M;
        for(int j = il + 1; j <= m + il + 1; ++j)
            dp[0][i][j] = (s * cur * NK(j - 1, il)) % M;
        s = 0LL;
        for(int j = m + il; j >= il + 1; --j)
        {
            s += dp[1][i - 1][j - il];
            s %= M;
            dp[0][i][j] += (s * cur * NK(j - 1, il)) % M;
        }

        s = 0LL;
        for(int j = 2; j <= m + 1 && il >= 1; ++j)
        {
            s += dp[0][i - 1][j - 1];
            s %= M;
            dp[1][i][j] = (s * cur * NK(m + 1 + il - j, il)) % M;
        }
        s = 0LL;
        for(int j = 3; j <= m + 2 && il >= 2; ++j)
        {
            s += dp[0][i - 1][j - 2];
            s %= M;
            dp[1][i][j] += (s * cur * (ll)(j - 1) * (ll)(m + 1 + il - j)) % M;
        }

        m += il + 1;
        for(int j = 1; j <= m; ++j)
        {
            dp[1][i][j] %= M;
            dp[0][i][j] %= M;
        }
    }
    for(int i = 1; i <= m; ++i)
        ans += dp[0][n][i];
    //cout << "m: " << m << "\n";
    //cout << "0 ans: " << ans << "\n";
    if(!en)
        for(int i = 1; i <= m; ++i)
            ans += dp[1][n][i];
    ans %= M;
    return make_pair(ans, m);
}

void Solve()
{
    int n, pr = 1, pos = 0LL;
    ll ans = 1LL;
    pair<int, ll> cur;
    cin >> n;
    cin >> itab[1] >> itab[2] >> itab[3];
    itab[1] = "x" + itab[1] + "x";
    itab[2] = "x" + itab[2] + "x";
    itab[3] = "x" + itab[3] + "x";
    for(int i = 0; i <= n; ++i)
    {
        if(itab[1][i] == 'x' && itab[1][i + 1] == 'x')
            ans = 0LL;
        if(itab[3][i] == 'x' && itab[3][i + 1] == 'x')
            ans = 0LL;
    }
    for(int i = 1; i <= n; ++i)
    {
        if(itab[2][i] == 'x' && (i == n || itab[2][i + 1] == 'o'))
        {
            bool st = false, en = false;
            if(pr == 1) st = true;
            if(i == n) en = true;
            //cout << "st kon:" << pr << " " << i << " " << ans << " " << pos << "\n";
            Construct(pr, i);
            cur = LiczDP(i - pr + 1, st, en);
            ans = (ans * NK(pos + cur.nd, cur.nd)) % M;
            ans *= cur.st; ans %= M;
            pos += cur.nd;
            continue;
        }
        if(itab[2][i] == 'x') continue;
        pr = i + 1;
        if(itab[1][i] == 'x')
        {
            ++pos;
            ans = (ans * NK(pos, 1)) % M;
        }
        if(itab[3][i] == 'x')
        {
            ++pos;
            ans = (ans * NK(pos, 1)) % M;
        }
    }
    cout << ans << "\n";
}

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

    return 0;
}