#include <stdio.h>
#include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
int f[2005][4005][2], s[2005][4005][2], sum[2005];
int fac[10005], inv[10005];
int n, ans = 1;
char g[4][2005];
int add(int a, int b) {
    a += b;
    return a >= mod ? a - mod : a;
}
int ksm(int a, int b) {
    int s = 1;

    for (; b; b >>= 1, a = 1ll * a * a % mod)
        if (b & 1)
            s = 1ll * s * a % mod;

    return s;
}
void Inc(int &a, int b) {
    a = add(a, b);
}
int C(int n, int m) {
    return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
void Pre() {
    fac[0] = 1;

    for (int i = 1; i <= 10000; i++)
        fac[i] = 1ll * fac[i - 1] * i % mod;

    inv[10000] = ksm(fac[10000], mod - 2);

    for (int i = 9999; i >= 0; i--)
        inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
}
void Proc(int n, int lim) {
    for (int i = 1; i <= lim; i++) {
        s[n][i][0] = add(s[n][i - 1][0], f[n][i][0]);
        s[n][i][1] = add(s[n][i - 1][1], f[n][i][1]);
    }
}
int main() {
    Pre();
    scanf("%d", &n);

    for (int i = 1; i < 4; i++) {
        scanf("%s", g[i] + 1);

        for (int j = 1; j <= n; j++)
            g[i][j] = g[i][j] == 'o';
    }

    if (!g[1][1] || !g[1][n] || !g[3][1] || !g[3][n])
        return puts("0"), 0;

    for (int i = 1; i < n; i++)
        if ((!g[1][i] && !g[1][i + 1]) || (!g[3][i] && !g[3][i + 1]))
            return puts("0"), 0;

    for (int p = 1, cnt = 0; p <= n; p++) {
        if (g[2][p]) {
            if (!g[1][p])
                cnt++, ans = 1ll * ans * cnt % mod;

            if (!g[3][p])
                cnt++, ans = 1ll * ans * cnt % mod;

            continue;
        }

        int l = p, r = p;

        while (r <= n && !g[2][r])
            sum[r - l + 1] = sum[r - l] + (!g[1][r] + !g[3][r] + 1), r++;

        r--;

        f[1][sum[1]][0] = fac[sum[1] - 1];

        for (int i = 1; i < sum[1]; i++)
            f[1][i][0] = 0;

        if (p != 1) {
            if (sum[1] == 1)
                f[1][1][1] = f[1][2][1] = 0;
            else if (sum[1] == 2)
                f[1][1][1] = fac[sum[1] - 1], f[1][2][1] = 0;
            else
                f[1][1][1] = f[1][2][1] = 2;
        }

        Proc(1, sum[1]);

        for (int i = 2; i <= r - l + 1; i++) {
            //for(int j=1;j<=sum[i-1]+2;j++) f[i][j][1]=0;
            for (int j = 1; j <= sum[i - 1] + 1; j++) {
                f[i][j][1] = s[i - 1][j - 1][0];
                f[i][j][0] = add(s[i - 1][sum[i - 1]][0], add(s[i - 1][sum[i - 1]][1], mod - s[i - 1][j - 1][1]));
            }

            f[i][sum[i - 1] + 2][1] = f[i][sum[i - 1] + 3][1] = 0;

            for (int j = sum[i - 1] + 1; j >= 1; j--) {
                if (sum[i] - sum[i - 1] == 3) {
                    f[i][j + 2][0] = 1ll * f[i][j][0] * j % mod * (j + 1) % mod;
                    f[i][j + 1][1] = add(f[i][j + 1][1], 1ll * f[i][j][1] * j % mod * (sum[i - 1] + 2 - j) % mod * 2 % mod);
                    f[i][j][1] = 1ll * f[i][j][1] * (sum[i - 1] + 2 - j) % mod * (sum[i - 1] + 3 - j) % mod;
                } else if (sum[i] - sum[i - 1] == 2) {
                    f[i][j + 1][0] = 1ll * f[i][j][0] * j % mod;
                    f[i][j][1] = 1ll * f[i][j][1] * (sum[i - 1] + 2 - j) % mod;
                } else
                    f[i][j][1] = 0;
            }

            for (int j = 1; j < sum[i] - sum[i - 1]; j++)
                f[i][j][0] = 0;

            Proc(i, sum[i]);
        }

        int res = 0;
        Inc(res, add((r != n)*s[r - l + 1][sum[r - l + 1]][1], s[r - l + 1][sum[r - l + 1]][0]));

        ans = 1ll * ans * res % mod * C(cnt + sum[r - l + 1], cnt) % mod;
        cnt += sum[r - l + 1];

        p = r;
    }

    printf("%d\n", ans);
    return 0;
}