#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long linf = 1LL << 62;
const unsigned long long ulinf = 1ULL << 63;
const double eps = 0.000001;
const double pi = 3.14159265358979323846;
template <class T>
T abs(T a) {
  return a >= 0 ? a : -a;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T mod(T a, T b) {
  return (a % b + b) % b;
}
long long powmod(long long a, long long b, long long c) {
  if (b == 0) return 1;
  long long ret = powmod(a, b >> 1, c);
  ret = ret * ret % c;
  if (b & 1) ret = ret * a % c;
  return ret;
}
template <class T>
void maxe(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void mine(T &a, T b) {
  if (a > b) a = b;
}
int iszero(double a) { return abs(a) <= eps; }
template <class T>
void geti(T &a) {
  a = 0;
  T b = 1;
  char c = getchar();
  if (c == '-')
    b = -1;
  else
    a = c - 48;
  while ((c = getchar()) != ' ' && c != '\n') a = a * 10 + c - 48;
  a *= b;
}
void fileio_in_out() {
  freopen(".in", "r", stdin);
  freopen(".out", "w", stdout);
}
void fileio_txt() {
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
}
const int N = 111111;
const int M = 111111;
int test;
int n, m, k;
long long ans;
long long dp[N][8];
char s[3][N];
int x, y;
const long long md = (long long)inf;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int f(int st) {
  int ret = 0;
  for (int i = 0; i < 4; i++)
    if (st & (1 << i)) ret++;
  return ret & 1;
}
long long calc(int st) {
  for (int i = 0; i < 4; i++)
    if (st & (1 << i))
      s[x + dx[i]][y + dy[i]] = s[x + 2 * dx[i]][y + 2 * dy[i]] = 'X';
  dp[0][7] = 1;
  for (int i = 1; i <= n; i++) {
    int t = (s[0][i] != '.') + (s[1][i] != '.') * 2 + (s[2][i] != '.') * 4;
    for (int j = 0; j < 8; j++) {
      if ((j & t) != t) {
        dp[i][j] = 0;
        continue;
      }
      if (j == 0) dp[i][j] = dp[i - 1][7];
      if (j == 1) dp[i][j] = (t == 1) ? dp[i - 1][7] : dp[i - 1][6];
      if (j == 2) dp[i][j] = (t == 2) ? dp[i - 1][7] : dp[i - 1][5];
      if (j == 3) {
        if (t == 0) dp[i][j] = (dp[i - 1][7] + dp[i - 1][4]) % md;
        if (t == 1) dp[i][j] = dp[i - 1][5];
        if (t == 2) dp[i][j] = dp[i - 1][6];
        if (t == 3) dp[i][j] = dp[i - 1][7];
      }
      if (j == 4) dp[i][j] = (t == 4) ? dp[i - 1][7] : dp[i - 1][3];
      if (j == 5) {
        if (t == 0) dp[i][j] = dp[i - 1][2];
        if (t == 1) dp[i][j] = dp[i - 1][3];
        if (t == 4) dp[i][j] = dp[i - 1][6];
        if (t == 5) dp[i][j] = dp[i - 1][7];
      }
      if (j == 6) {
        if (t == 0) dp[i][j] = (dp[i - 1][7] + dp[i - 1][1]) % md;
        if (t == 2) dp[i][j] = dp[i - 1][3];
        if (t == 4) dp[i][j] = dp[i - 1][5];
        if (t == 6) dp[i][j] = dp[i - 1][7];
      }
      if (j == 7) {
        if (t == 0)
          dp[i][j] = (dp[i - 1][0] + dp[i - 1][3] + dp[i - 1][6]) % md;
        if (t == 1) dp[i][j] = (dp[i - 1][7] + dp[i - 1][1]) % md;
        if (t == 2) dp[i][j] = dp[i - 1][2];
        if (t == 3) dp[i][j] = dp[i - 1][3];
        if (t == 4) dp[i][j] = (dp[i - 1][7] + dp[i - 1][4]) % md;
        if (t == 5) dp[i][j] = dp[i - 1][5];
        if (t == 6) dp[i][j] = dp[i - 1][6];
        if (t == 7) dp[i][j] = dp[i - 1][7];
      }
    }
  }
  for (int i = 0; i < 4; i++)
    if (st & (1 << i))
      s[x + dx[i]][y + dy[i]] = s[x + 2 * dx[i]][y + 2 * dy[i]] = '.';
  return dp[n][7];
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < 3; i++) {
    scanf("%s", s[i] + 1);
    for (int j = 1; j <= n; j++)
      if (s[i][j] == 'O') {
        x = i;
        y = j;
      }
  }
  if (x <= 2 && s[x + 1][y] == '.' && s[x + 2][y] == '.') k += 1;
  if (y <= n - 2 && s[x][y + 1] == '.' && s[x][y + 2] == '.') k += 2;
  if (x >= 2 && s[x - 1][y] == '.' && s[x - 2][y] == '.') k += 4;
  if (y >= 1 + 2 && s[x][y - 1] == '.' && s[x][y - 2] == '.') k += 8;
  for (int i = 1; i < 16; i++)
    if ((k & i) == i) {
      long long t = calc(i);
      if (f(i))
        ans = mod(ans + t, md);
      else
        ans = mod(ans - t, md);
    }
  printf("%I64d\n", ans);
  return 0;
}
