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

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

LL MOD;
LL mod(LL x, LL m = MOD) { return (x % m + m) % m; }
pair<LL, LL> ex_gcd(LL a, LL b) {
	if(b == 0) { return MP(1, 0); }
	auto p = ex_gcd(b, a % b);
	return MP(p.SE, p.FI - (a / b) * p.SE);
}
LL inv(LL x, LL m = MOD) {
	assert(gcd(x, m) == 1);
	auto p = ex_gcd(x, m);
	return mod(p.FI, m);
}
LL promod(LL x, LL y, LL m = MOD) { return mod((x % m) * (y % m), m); }
LL divmod(LL x, LL y, LL m = MOD) { return promod(x, inv(y, m), m); }

// ----

struct CombMod {
	LL lim = 0, mod;
	LL * fact; // fact[i]: i の階乗
	LL * finv; // finv[i]: i の階乗の逆元
	
	CombMod() { }
	CombMod(LL lim, LL mod = MOD) { init(lim, mod); }
	void init(LL arg_lim, LL arg_mod = MOD) {
		lim = arg_lim;
		mod = arg_mod;
		fact = new LL[lim + 1];
		finv = new LL[lim + 1];
		fact[0] = 1;
		inc1(i, lim) { fact[i] = promod(fact[i - 1], i, mod); }
		finv[lim] = inv(fact[lim], mod);
		dec(i, lim) { finv[i] = promod(finv[i + 1], i + 1, mod); }
	}
	LL P(LL a, LL b) {
		assert(inII(a, 0, lim) && inII(b, 0, lim));
		return (a < b ? 0 : promod(fact[a], finv[a - b], mod));
	}
	LL C(LL a, LL b) {
		assert(inII(a, 0, lim) && inII(b, 0, lim));
		return (a < b ? 0 : promod(P(a, b), finv[b], mod));
	}
	LL H(LL a, LL b) {
		assert(inII(a, 0, lim) && inII(b, 0, lim) && inII(a + b - 1, -1, lim));
		return (a == 0 ? (b == 0) : C(a + b - 1, b));
	}
};

// ----

LL ex(LL x, LL y, LL MOD = MOD) {
	LL z[64];
	z[0] = x;
	incID(i, 1, 64) {
		z[i] = z[i - 1] * z[i - 1] % MOD;
	}
	
	LL v = 1;
	inc(i, 64) {
		if((y >> i) & 1) { (v *= z[i]) %= MOD; }
	}
	
	return v;
}

// ----

LL n, r, g, b, dp[4][1502][1002];

int main() {
	cin >> n >> r >> g >> b;
	
	MOD = 1e9 + 7;
	
	n++;
	dp[0][0][0] = 1;
	inc(i, n) {
		inc(j, i + 1) {
		inc(k, i + 1) {
			(dp[(i + 1) % 4][j + 0][k + 0] += dp[i % 4][j][k]) %= MOD;
			(dp[(i + 2) % 4][j + 1][k + 0] += dp[i % 4][j][k]) %= MOD;
			(dp[(i + 3) % 4][j + 0][k + 1] += dp[i % 4][j][k]) %= MOD;
			dp[i % 4][j][k] = 0;
		}
		}
	}
	
	CombMod cm(1500);
	
	LL ans = 0;
	incII(y, 0, 1000) {
		int x = (r + g + b) - 2 * y;
		if(x < 0) { continue; }
		if(2 * x + 3 * y > n) { continue; }
		
		incII(xr, 0, r) {
			int yr = r - xr;
			int xgb = x - xr;
			int ygb = y - yr;
			if(x < xr || y < yr) { continue; }
			
			LL c = dp[n % 4][x][y];
			c = promod(c, cm.C(x, xr));
			c = promod(c, cm.C(y, yr));
			c = promod(c, ex(2, yr));
			c = promod(c, ex(2, ygb));
			c = promod(c, cm.C(xgb + yr, g - ygb));
			(ans += c) %= MOD;
		}
	}
	
	cout << ans << endl;
	
	return 0;
}