#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

void mod_inverse(int n, vector<long long>& inv, int mod)
{
    inv.assign(n+1, -1);
    inv[1] = 1;
    for(int i=2; i<=n; ++i)
        inv[i] = inv[mod % i] * (mod - mod / i) % mod;
}

class FactorialCalculation
{
private:
    const int mod;
    vector<long long> factorial;
    vector<long long> invFactorial;
public:
    FactorialCalculation(int n, int mod) : mod(mod)
    {
        factorial.resize(n+1, 1);
        invFactorial.resize(n+1, 1);
        vector<long long> inv;
        mod_inverse(n, inv, mod);
        for(int i=1; i<=n; ++i){
            factorial[i] = factorial[i-1] * i % mod;
            invFactorial[i] = invFactorial[i-1] * inv[i] % mod;
        }
    }
    long long getFactorial(int n){
        return factorial[n];
    }
    long long getInvFactorial(int n){
        return invFactorial[n];
    }
    long long getPermutation(int n, int r){
        if(n < r)
            return 0;
        return factorial[n] * invFactorial[n-r] % mod;
    }
    long long getCombination(int n, int r){
        if(n < r)
            return 0;
        return getPermutation(n, r) * invFactorial[r] % mod;
    }
    long long getHomogeneous(int n, int r){
        return getCombination(n+r-1, r);
    }
};

const int MOD = 1000000007;

long long power(int a, int b)
{
    long long ret = 1;
    long long tmp = a;
    while(b > 0){
        if(b & 1){
            ret *= tmp;
            ret %= MOD;
        }
        tmp *= tmp;
        tmp %= MOD;
        b >>= 1;
    }
    return ret;
}

int main()
{
    int n, r, g, b;
    cin >> n >> r >> g >> b;
    int sum = r + g + b;
    int white = n - sum;

    FactorialCalculation fc(2*n, MOD);
    long long ans = 0;
    for(int p=0; p<=sum/2; ++p){
		long long tmp = fc.getCombination(white+1, sum-p);
        tmp *= fc.getCombination(sum-p, p);
        tmp %= MOD;
        tmp *= power(2, p);
        tmp %= MOD;

        for(int i=0; i<=p; ++i){
            int r2 = r - i;
            int g2 = g - (p - i);
            int b2 = b - (p - i);
            if(r2 < 0 || g2 < 0 || b2 < 0)
                continue;

			long long tmp2 = tmp;
            tmp2 *= fc.getCombination(p, i);
            tmp2 %= MOD;
            tmp2 *= fc.getCombination(sum - 2 * p, r2);
            tmp2 %= MOD;
            tmp2 *= fc.getCombination(g2 + b2, g2);
            tmp2 %= MOD;

            ans += tmp2;
            ans %= MOD;
        }
    }
    cout << ans << endl;

    return 0;
}