// Author: Kajetan Ramsza
#include "bits/stdc++.h"
using namespace std;

#define rep(i, a, b) for(int i = (a); i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

template<typename F, typename S> ostream& operator<<(ostream& os, const pair<F, S> &p) { return os<<"("<<p.first<<", "<<p.second<<")"; }
template<typename T> ostream &operator<<(ostream & os, const vector<T> &v) { os << "{"; typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) { if( it != v.begin() ) os << ", "; os << *it; } return os << "}"; }



void dbg_out() { cerr<<'\n'; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr<<' '<<H; dbg_out(T...); }

#ifdef DEBUG
#define dbg(...) cerr<<"(" << #__VA_ARGS__ <<"):", dbg_out(__VA_ARGS__)
#else
#define dbg(...) 
#endif

const ll mod = 1e9 + 7;

int n;
vector<array<int, 3>> board;
vector<pii> pawns;
vector<ll> dp;

ll solve(int mask) {
	if(dp[mask] != -1) return dp[mask];
	vector<array<int, 3>> curr(board);
	rep(i,0,sz(pawns))
		if((mask>>i) & 1) 
			curr[pawns[i].first][pawns[i].second] = true;
	ll res = 0;
	rep(id,0,sz(pawns)) {
		auto [i,j] = pawns[id];
		if(curr[i][j]) continue;
		if((i > 0 && i < n-1 && curr[i-1][j] && curr[i+1][j]) ||
		   (j == 1 && curr[i][j-1] && curr[i][j+1]))
		   	res = (res + solve(mask | (1<<id))) % mod;
	}
	return dp[mask] = res;
}

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin>>n;
	board.resize(n);
	 rep(j,0,3) rep(i,0,n) {
		char c; cin>>c;
		board[i][j] = c == 'o';
		if(!board[i][j]) pawns.push_back({i, j});
	}
	dp.assign(1<<sz(pawns), -1);
	dp[(1<<sz(pawns))-1] = 1;
	cout<<solve(0)<<'\n';
}