#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int mod = 1e9 + 7;
int norm(int x) { return x >= mod ? x - mod : x; }
int reduce(int x) { return x < 0 ? x + mod : x; }
int neg(int x) { return x ? mod - x : 0; }
int quo2(int x) { return (x + (x & 1 ? mod : 0)) >> 1; }
void add(int &x, int y) { x += y, x = x >= mod ? x - mod : x; }
void sub(int &x, int y) { x -= y, x = x < 0 ? x + mod : x; }
void fam(int &x, int y, int z) { x = (x + (ll)y * z) % mod; }
int mpow(int a, int b) {
  int ret = 1;
  for (; b; b >>= 1) {
    if (b & 1) ret = (ll)ret * a % mod;
    a = (ll)a * a % mod;
  }
  return ret;
}

const int N = 2e3;

int n, cnt[N + 5], m;
int fac[N * 3 + 5], ifac[N * 3 + 5], inv[N * 3 + 5];
char a[3][N + 5];
int f[N + 5][2][N * 3 + 5], ans;

int main() {
  scanf("%d%s%s%s", &n, a[0] + 1, a[1] + 1, a[2] + 1);
  if (a[0][1] == 'x' || a[2][1] == 'x' || a[0][n] == 'x' || a[2][n] == 'x') { puts("0"); return 0; }
  for (int i = 1; i < n; ++i)
    if ((a[0][i] == 'x' && a[0][i + 1] == 'x') || (a[2][i] == 'x' && a[2][i + 1] == 'x')) { puts("0"); return 0; }
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < 3; ++j)
      m += a[j][i] == 'x';
    cnt[i] = m;
  }
  fac[0] = 1;
  for (int i = 1; i <= m; ++i) fac[i] = (ll)fac[i - 1] * i % mod;
  ifac[m] = mpow(fac[m], mod - 2);
  for (int i = m; i; --i) ifac[i - 1] = (ll)ifac[i] * i % mod;
  for (int i = 1; i <= m; ++i) inv[i] = (ll)ifac[i] * fac[i - 1] % mod;
  f[0][0][0] = 1;
  for (int i = 1; i <= n; ++i) {
    if (a[1][i] == 'o') {
      f[i][0][0] = accumulate(f[i - 1][0], f[i - 1][0] + cnt[i - 1] + 1, 0ll) % mod;
      continue;
    }
    int c = cnt[i] - cnt[i - 1];
    for (int j = 0; j <= cnt[i - 1]; ++j)
      if (f[i - 1][0][j] || f[i - 1][1][j])
        f[i][0][c] = (f[i][0][c] + (ll)f[i - 1][0][j] * inv[c]) % mod,
        f[i][0][j + c] = (f[i][0][j + c] + (ll)f[i - 1][1][j] * inv[j + c]) % mod;
    if (i == 1 || i == n) continue;
    for (int j = 0; j <= cnt[i - 1]; ++j)
      if (f[i - 1][0][j] || f[i - 1][1][j])
        f[i][0][j + 1] = (f[i][0][j + 1] + (ll)(f[i - 1][0][j] + f[i - 1][1][j]) * inv[j + 1]) % mod,
        f[i][1][j + 1] = (f[i][1][j + 1] + (ll)(f[i - 1][0][j] + f[i - 1][1][j]) * (mod - inv[j + 1])) % mod,
        f[i][0][j + c] = (f[i][0][j + c] + (ll)(f[i - 1][0][j] + f[i - 1][1][j]) * (mod - inv[j + c])) % mod,
        f[i][1][j + c] = (f[i][1][j + c] + (ll)(f[i - 1][0][j] + f[i - 1][1][j]) * inv[j + c]) % mod;
  }
  ans = accumulate(f[n][0], f[n][0] + m + 1, 0ll) % mod * fac[m] % mod, printf("%d\n", ans);
}