# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
# define int long long 
# define lc u << 1
# define rc u << 1 | 1
# define fi first
# define se second
# define endl "\n"
const int N = 3005, mod = 1000000007;

int n, r, g, b;
int C[N][N];
void init ()
{
	C[0][0] = 1;
	for (int i = 1; i < N; i ++ )
	{
		C[i][0] = C[i - 1][0];
		for (int j = 1; j <= i; j ++ )
			C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
	}

}
signed main ()
{
    // freopen ("RGB.in", "r", stdin); freopen ("RGB.out", "w", stdout);
    init ();
	cin >> n >> r >> g >> b;
	if (r > g) swap (r, g);
	if (r > b) swap (r, b);
	if (g > b) swap (g, b);
	int ans = 0, pw = 1;
	for (int S2 = 0; 2 * S2 <= r + g + b; S2 ++ )
	{
		int S1 = r + g + b - 2 * S2;
		int res = 0;
		for (int i = 0; i <= min (S2, r); i ++ )
		{
			for (int j = 0; j <= min (S2, g); j ++ )
			{
				int k = 2 * S2 - i - j;
				if (0 <= k && k <= b)
				{
					int a = S2 - i, b = S2 - j, c = S2 - k;
					res = (res + C[S2][a] * C[S2 - a][b] % mod * 
						C[S1][r - i] % mod * C[S1 - r + i][g - j]) % mod;
				}
			}
		}
		ans = (ans + res * 
			C[n + 1 - S2 * 2 - S1][S2] % mod * 
			C[n + 1 - S2 * 3 - S1][S1] % mod * pw) % mod;
		pw = pw * 2 % mod;
	}
	cout << ans << endl;
	return 0;
}