#include <iostream>
#include <vector>
#include <algorithm>
#include <array>

using namespace std;

const int MOD = 1000000007;
const int MAXN = 2000007;

int add(int a, int b) { a += b; return a -= (a >= MOD ? MOD : 0); }
int sub(int a, int b) { a -= b; return a += (a  < 0   ? MOD : 0); }
int mul(int a, int b) { return (int) ((int64_t) a * b % MOD); }
int bpow(int a, int p) {
	int x = 1;
	for (; p; p >>= 1) {
		if (p & 1) x = mul(x, a);
		a = mul(a, a);
	}
	return x;
}

int fact[MAXN], ifact[MAXN], pow2[MAXN], N, G, I, E;
int choose(int n, int k) {
	return mul(fact[n], mul(fact[k], fact[n-k]));
}

int main() {
	cin >> N >> G >> I >> E;
	fact[0] = 1;
	for (int i = 1; i <= 2*N; ++i) fact[i] = mul(fact[i-1], i);
	ifact[2*N] = bpow(fact[2*N], MOD - 2);
	for (int i = N*2-1; i >= 0; --i) ifact[i] = mul(ifact[i+1], i+1);
	pow2[0] = 1;
	for (int i = 1; i <= 2*N; ++i) pow2[i] = add(pow2[i-1], pow2[i-1]);

	G = min(G, N*2);
	E = min(E, N*2-G);
	I = min(I, N*2-G-E);

	int ans = 0;
	for (int a = 0; a <= N; ++a) {
		int b = G - a * 2, c = N - a - b;
		if (b < 0 || c < 0) continue;

		int probAB = 1, score = G;
		probAB = mul(probAB, fact[N]);
		probAB = mul(probAB, ifact[a]);
		probAB = mul(probAB, ifact[b]);
		probAB = mul(probAB, ifact[N-a-b]);
		probAB = mul(probAB, pow2[b]);
		probAB = mul(probAB, ifact[2*N]);
		probAB = mul(probAB, fact[2*N-G]);
		probAB = mul(probAB, fact[G]);

		bool remainingE = 0;
		if (b < E) {
			remainingE = (E-b) & 1;
			score += E - remainingE;
			c -= (E-b) / 2 + remainingE;
			b = remainingE;
		} else {
			b -= E;
			score += E;
		}

		// cout << a << ' ' << b << ' ' << c << " - " << I << endl;
		if (c >= I) {
			score += I;
		} else {
			score += c;
			int rI = I - c;

			if (remainingE) {
				remainingE = 0;
				score += 1;
				--b;
				--rI;
			}
			if (rI > b) score -= rI - b;
		}
		// cout << a << ": " << probAB << ' ' << score << endl;
		ans = add(ans, mul(probAB, score));
	}
	cout << ans << endl;
}