#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<unordered_map>
#include<array>
#include<map>
#include<iomanip>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
#define dme cout<<-1<<endl;return 0
//ios::sync_with_stdio(false);
//<< setprecision(5)
const int mod=1e9+7;
const int big=1e8+100;
const long double pai=3.141592653589793238462643383279502884197;
const long double ena=2.71828182845904523536;
const long double eps=1e-7;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
llint fla[3001];
llint Div[3001];//逆元
llint nCr(int n,int r){
	if(n<0||r<0||r>n){return 0;}
	return (((fla[n]*Div[r])%mod)*Div[n-r])%mod;
}
int main(void){
	llint n,R,G,B,i,j,ans=0,col;cin>>n>>R>>G>>B;
	col=R+G+B;
	if(n<col){cout<<0<<endl;return 0;}
	fla[0]=1;
	for(i=1;i<=3000;i++){fla[i]=fla[i-1]*i%mod;}
	llint gen=1,kur=fla[3000];
	for(i=0;i<30;i++){
		if(((mod-2)&(1<<i))!=0){gen*=kur;gen%=mod;}
		kur*=kur;kur%=mod;
	}
	Div[3000]=gen;
	for(i=3000;i>0;i--){Div[i-1]=Div[i]*i%mod;}
	//cerr<<"Div[5]="<<Div[3000]*fla[3000]%mod;
	for(i=0;i<n;i++){//連続の数
		llint pps=i;
		llint ps=col-pps*2;
		llint s=1+n-pps*3-ps*2;
		if(ps<0||s<0){continue;}
		llint now=fla[pps+ps+s]*Div[pps];now%=mod;
		now*=Div[ps];now%=mod;
		now*=Div[s];now%=mod;
		llint bek=1;
		for(j=0;j<pps;j++){bek*=2;bek%=mod;}
		//cout<<"pps="<<pps<<"ps="<<ps<<"s="<<s;
		//cout<<"de now="<<now<<endl;
		for(llint ir=0;ir<=R;ir++){
			//ir 相席red
			//pps C ir
			//2 ** ir
			//B+G C B
			llint cou=now*nCr(pps,ir)%mod;
			cou*=bek;cou%=mod;
			cou*=nCr(ps,R-ir);cou%=mod;
			cou*=nCr(G-(pps-ir)+B-(pps-ir),G-(pps-ir));
			cou%=mod;
			//cerr<<"ir="<<ir<<"cou="<<cou;
			ans+=cou;ans%=mod;
		}
	}
	cout<<ans<<endl;
	return 0;
}