import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = 18446744073709551615
inf = 4294967295
md = 10**9+7
# md = 998244353

def nHr(hn, hr):
    return nCr(hn+hr-1, hr-1)

def nPr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_n-com_r]%md

def nCr(com_n, com_r):
    if com_r < 0: return 0
    if com_n < com_r: return 0
    return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md

# 準備
n_max = 3005
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md

pw = [1]
for i in range(3000): pw.append(pw[-1]*2%md)

n, r, g, b = LI()
s = r+g+b

# s+s-p-1<=n
# 2s-n-1<=p
pmin = max(0, 2*s-n-1)
pmax = min(s//2, s-max(r, g, b))
# print(pmin,pmax)

ans = 0
for p in range(pmin, pmax+1):
    cur = 0
    for a in range(min(r, p)+1):
        cur += nCr(p, a)*pw[p]%md*nCr(s-2*p, r-a)%md*nCr(s-2*p-r+2*a, g-(p-a))%md
        cur%=md
        # print(a,cur)
    ans += cur*nCr(s-p, p)*nCr(n-s+1, s-p)%md
    ans%=md

print(ans)