#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
int myhash(int a, int b, int c) {
	return a * 1000000 + b * 1000 + c;
}
void unhash(int &a,int &b,int &c,int h) {
	c = h % 1000;
	h /= 1000;
	b = h % 1000;
	h /= 1000;
	a = h;
}
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N, A, B, C;
	cin >> N >> A >> B >> C;
	N++;
	if (A + B + C - 3> (2.0 / 3.0)*N) {
		cout << 0 << endl;
		return 0;
	}


	vector<map<int, int> > dp(N + 1);
	dp[0][myhash(A, B, C)] = 1;
	int a, b, c;
	for (int i = 0; i < N; i++) {
		for (auto mp : dp[i]) {
			dp[i + 1][mp.first] = (dp[i + 1][mp.first] + mp.second) % MOD;
			unhash(a, b, c, mp.first);
		//	cerr << i << " " << a << " " << b << " " << c << " " << mp.second << endl;
			if (i + 2 <= N) {
				if (a > 0) {
					dp[i + 2][myhash(a - 1, b, c)] = (dp[i + 2][myhash(a - 1, b, c)] + mp.second) % MOD;
				}
				if (b > 0) {
					dp[i + 2][myhash(a, b - 1, c)] = (dp[i + 2][myhash(a, b - 1, c)] + mp.second) % MOD;
				}
				if (c > 0) {
					dp[i + 2][myhash(a, b, c - 1)] = (dp[i + 2][myhash(a, b, c - 1)] + mp.second) % MOD;
				}
			}
			if (i + 3 <= N) {
				if (a > 0 && b > 0) {
					dp[i + 3][myhash(a - 1, b - 1, c)] = (dp[i + 3][myhash(a - 1, b - 1, c)] + 2 * mp.second) % MOD;
				}
				if (b > 0 && c > 0) {
					dp[i + 3][myhash(a, b - 1, c - 1)] = (dp[i + 3][myhash(a, b - 1, c - 1)] + 2 * mp.second) % MOD;
				}
				if (c > 0 && a > 0) {
					dp[i + 3][myhash(a - 1, b, c - 1)] = (dp[i + 3][myhash(a - 1, b, c - 1)] + 2 * mp.second) % MOD;
				}
			}
		}
	}
	cout << dp[N][0] << endl;
}