#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 10003, mod = 1e9 + 7;
template<typename T>
inline void read(T &x){
	int ch = getchar(); x = 0;
	while(ch < '0' || ch > '9') ch = getchar();
	while(ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
}
inline void qmo(int &x){x += (x >> 31) & mod;}
int n, r[3], a[4], C[4][N], inv[N], f[N][N], ans;
char s[3][N];
inline int ksm(int a, int b){
	int res = 1;
	for(;b;b >>= 1, a = (LL) a * a % mod) if(b & 1) res = (LL) res * a % mod;
	return res;
}
int main(){
	read(n);
	for(int i = 0;i < 3;++ i) read(r[i]), ++r[i], scanf("%s", s[i]);
	for(int i = 0;i < n;++ i)
		++ a[(s[0][i] == s[1][i]) << 1 | (s[0][i] == s[2][i])];
	if(a[2] > a[0]) swap(a[0], a[2]), swap(r[0], r[2]);
	if(a[2] > a[1]) swap(a[1], a[2]), swap(r[1], r[2]);
	inv[1] = 1;
	for(int i = 2;i <= n;++ i)
		inv[i] = mod - (LL) mod / i * inv[mod % i] % mod;
	for(int i = 0;i < 4;++ i){
		C[i][0] = 1;
		for(int j = 1;j <= a[i];++ j) C[i][j] = C[i][j - 1] * (a[i] - j + 1ll) % mod * inv[j] % mod;
	}
	for(int i = 0;i <= a[2];++ i)
		for(int j = 0;j <= a[3];++ j)
			qmo(f[i + j][j + a[2] - i] += (LL) C[2][i] * C[3][j] % mod - mod);
	for(int i = a[2] + a[3];~i;-- i)
		for(int j = a[2] + a[3] - max(i - a[3], 0), *x = f[i], *y = f[i + 1];~j;-- j)
			qmo(x[j] += y[j] - mod), qmo(x[j] += x[j + 1] - mod), qmo(x[j] -= y[j + 1]);
	for(int i = 0;i <= a[0];++ i)
		for(int j = 0;j <= a[1];++ j){
			int x = max(r[0] - i - j, r[1] + i + j - a[0] - a[1]), y = r[2] - a[0] + i - j;
			if(x < 0) x = 0; 
			if(y < 0) y = 0;
			if(x > a[2] + a[3] || y > a[2] + a[3]) continue;
			qmo(ans += (LL) f[x][y] * C[0][i] % mod * C[1][j] % mod - mod);
		}
	qmo(ans = ksm(2, n) - ans);
	printf("%d\n", ans);
}