#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1000000007;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 10010;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


int N;
char A[3][2010];

int main() {
  prepare();
  
  for (; ~scanf("%d", &N); ) {
    for (int x = 0; x < 3; ++x) {
      scanf("%s", A[x]);
    }
    
    bool valid = true;
    for (const int x : {0, 2}) {
      for (int y = 0; y < N; ++y) if (A[x][y] == 'x') {
        valid = valid && (0 <= y - 1 && A[x][y - 1] == 'o');
        valid = valid && (y + 1 <  N && A[x][y + 1] == 'o');
      }
    }
    Mint ans = 0;
    if (valid) {
      {
        int cnt = 0;
        for (int x = 0; x < 3; ++x) for (int y = 0; y < N; ++y) if (A[x][y] == 'x') ++cnt;
        ans = fac[cnt];
      }
      /*
        decide <,>,= on row 1
        a < b > c ==> constraints above b and below b
        PIE on >
        dp[y][u][k]
          - decided up to [p(1, y-1) > p(1, y)]
          - u: [p(1, y-1) > p(1, y)]
          - k: subtree size at (1, y)
      */
      for (int l = 0, r = 0; l < N; l = r) {
        for (; r < N && A[1][l] == A[1][r]; ++r) {}
        if (A[1][l] == 'x') {
          vector<Mint> crt[2]{
            {0, 1, 0, 0},
            {0, 0, 0, 0},
          };
          for (int y = l; y < r; ++y) {
            vector<Mint> nxt[2];
            for (int u = 0; u < 2; ++u) nxt[u].assign(3 * (y - l + 2) + 1, 0);
            for (int u = 0; u < 2; ++u) for (int k = 0; k < (int)crt[u].size(); ++k) if (crt[u][k]) {
              for (int v = 0; v < 2; ++v) {
                int kk = k;
                if (!(u == 0 && v == 1)) {
                  for (const int xx : {0, 2}) if (A[xx][y] == 'x') ++kk;
                }
                const Mint t = crt[u][k] * inv[kk];
                if (v == 0) {
                  nxt[v][kk + 1] += t;
                } else {
                  nxt[v][1] += t;
                  nxt[v][kk + 1] -= t;
                }
              }
            }
            for (int u = 0; u < 2; ++u) crt[u].swap(nxt[u]);
          }
          ans *= crt[1][1];
        }
      }
    }
    printf("%u\n", ans.x);
  }
  return 0;
}