题意
(0,0,0)---->(x,y,z)
n步恰好 可以前进后退
我们可以固定一维 也就是 C (n,i)*cal(i,a)
C(x,(x+y)/2);
其他两维 cal2(n-i,b,c)
cal(x,y+z)%mod*cal(x,abs(y-z))%mod;
#include <bits/stdc++.h>
using namespace std;
#define int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first
#define y second
#define pb push_back
#define inf 1e18
#define IOS std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define der(i,a,b) for(int i=a;i>=b;i--)
const int mod=1e9+7;
int qsm(int a,int b)
{
int res=1; while(b){ if(b&1) res=res*a%mod; a=a*a%mod; b>>=1; } return res;}
const int N=4e5+10;
int n,m;
int a,b,c;
int k;
int fac[N];
int in[N];
void init()
{
in[0]=fac[0]=1;
fer(i,1,N-1) fac[i]=fac[i-1]*i%mod;
fer(i,1,N-1) in[i]=in[i-1]*qsm(i,mod-2)%mod;
}
int C(int n,int m)
{
if(n<m||m<0)return 0;
return fac[n]*in[n-m]%mod*in[m]%mod;
}
int cal(int x,int y)
{
if(x<y||(x-y)&1)return 0;
return C(x,(x+y)/2);
}
int cal2(int x,int y,int z)
{
if(x<y+z||(x-y-z)&1)return 0;
return cal(x,y+z)%mod*cal(x,abs(y-z))%mod;
}
void solve()
{
init();
cin>>n>>a>>b>>c;
a=abs(a);
b=abs(b);
c=abs(c);
if(a+b+c>n||(n-a-b-c)&1)
{
puts("0");
return ;
}
int ans=0;
fer(i,0,n)
{
ans=(ans+C(n,i)*cal(i,a)%mod*cal2(n-i,b,c)%mod)%mod;
}
cout<<ans<<endl;
}
signed main()
{
IOS;
int _=1;
//cin>>_;
while(_--) solve();
return 0;
}