/* Generated by the powerful Sio Tool
 * You can download the binary file here: https://github.com/Arapak/sio-tool
 * Author:  (Karol Bonat)
 * Time of creation: 2024-03-18 10:40:09
 * Notes: 
**/

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

constexpr int MAXN = 1000006;

int n;
bool pla[5][MAXN];
bool ter[5][MAXN];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	vector<pair<int, int>> pus;

	for(int i = 1; i <= 3; i++){
		for(int j = 1; j <= n; j++){
			char t;
			cin >> t;
			pla[i][j] = (t=='o');
			if(t=='x') pus.push_back({i, j});
		}
	}
	int r = 0;
	do{	
		for(int i = 1; i <= 3; i++){
			for(int j = 1; j <= n; j++){
				ter[i][j] = pla[i][j];
			}
		}
		bool ok = 1;
		for(auto t : pus){
			if((ter[t.first+1][t.second] && ter[t.first-1][t.second]) || (ter[t.first][t.second+1] && ter[t.first][t.second-1])){
				ter[t.first][t.second]=1;
			}
			else{
				ok=0;
				break;
			}
		}
		r+=ok;
	} while(next_permutation(pus.begin(), pus.end()));
	cout << r << '\n';
	return 0;
}