#include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;

cs int N = 1e4 + 5; 

using ll = long long ; 

cs int mod = 1e9 + 7;
int add(int a, int b) {
    return a + b >= mod ? a + b - mod : a + b; 
}
void Add(int & a, int b) {
    a = add(a, b);
}
int dec(int a, int b) {
    return a - b < 0 ? a - b + mod : a - b; 
}
void Dec(int & a, int b) {
    a = dec(a, b);
}
int mul(int a, int b) {
    return 1ll * a * b % mod;
}
void Mul(int & a, int b) {
    a = mul(a, b);
}
int ksm(int a, int b) {
    int c = 1; for(; b; b >>= 1, a = mul(a, a))
        if(b & 1) c = mul(c, a); return c; 
}
int n, r[3];
char S[3][N];
int fc[N], ifc[N];

int C(int n, int m) {
    if(n < 0 || m < 0 || n < m) return 0; 
    return mul(fc[n], mul(ifc[n - m], ifc[m]));
}

int work2(int ia, int ib) {
    int r1 = r[ia], r2 = r[ib];
    int d = 0; 
    for(int i = 1; i <= n; i++) 
        d += S[ia][i] != S[ib][i];
    int ans = 0; 
    for(int i = 0; i <= n - d; i++)
        for(int j = 0; j <= d; j++) {
            if(i + d - j <= r1 && i + j <= r2) {
                Add(ans, mul(C(n - d, i), C(d, j)));
            }
        }
    return ans; 
}

int main() {
    #ifdef zqj
    freopen("1.in", "r", stdin);
    #endif

    cin >> n; 

    fc[0] = ifc[0] = 1; 
    for(int i = 1; i <= n; i++) fc[i] = mul(fc[i - 1], i);
    ifc[n] = ksm(fc[n], mod - 2);
    for(int i = n -1; i; i--) ifc[i] = mul(ifc[i + 1], i + 1);

    for(int i = 0; i < 3; i++) {
        scanf("%d%s", &r[i], S[i] + 1);
    }

    int ans = 0 ; 
    for(int i = 0; i < 3; i++) {
        for(int j = 0; j <= r[i]; j++)
            Add(ans, C(n, j));
    }

    Dec(ans, work2(0, 1));
    Dec(ans, work2(0, 2));
    Dec(ans, work2(1, 2));

    // cout << ans << '\n';

    int a = 0, b = 0, c = 0, d = 0; 
    for(int i = 1; i <= n; i++) {
        int x = 0; 
        for(int j = 0; j < 3; j++) 
            x |= (S[j][i] - '0') << j; 
        if(x == 0 || x == 7) ++ a; 
        if(x == 4 || x == 3) ++ b; 
        if(x == 2 || x == 5) ++ c; 
        if(x == 1 || x == 6) ++ d; 
    }

    static int s[N], f[N][N], g[N][N];
    for(int i = 0; i <= r[0]; i++) {
        s[i] = add(i ? s[i - 1] : 0, C(d, i));
    }
    int lim = (r[0] + min(r[1], r[2]) + 1) / 2; 
    for(int i = 0; i <= r[0]; i++) {
        for(int j = 0; j <= i; j++) {
            f[i][j] = j ? f[i][j - 1] : 0; 
            Add(f[i][j], mul(C(a, j), s[i - j]));
        }
    }
    for(int i = 0; i <= r[0]; i++) {
        for(int j = 0; j <= lim; j++) {
            g[i][j] = add((i > 0 && j > 0) ? g[i - 1][j - 1] : 0, mul(C(a, j), i > 0 ? s[i - 1] : 0));
        }
    }
    
    // cout << a <<' ' << b << ' ' << c << ' ' << d <<endl;
    for(int j = 0; j <= b; j++)
        for(int k = 0; k <= c; k++) {
            int c1 = r[0] - (b - j) - (c - k);
            if(c1 < 0) continue; 
            int c2 = b - j + k + d - r[1];
            int c3 = j + c - k + d - r[2];
            c2 = max(c2, c3); 
            if(c1 < c2) continue; 
            
            int len = c1 - c2 + 1;
            int mid = (c2 + c1) / 2; 
            // cerr << "FFF "<< j << ' ' << k << ' ' <<c1 << ' ' <<c2 << ' ' << len << ' ' << f[c1][min(c1, (len - 1) / 2)] << ' ' << g[mid][min(mid, (len - 1) / 2)]<< endl;
            int cc = f[c1][min(c1, (len - 1) / 2)];
            if(mid >= 0) Dec(cc, g[mid][(len - 1) / 2]);

            Mul(cc, mul(C(b, j), C(c, k)));
            Add(ans, cc);
        }
    cout << ans << '\n';

    return 0; 
}