MOD = 10 ** 9 + 7
N, R, G, B = map(int, input().split())

try:
    import pypyjit
    pypyjit.set_param('max_unroll_recursion=-1')
except ModuleNotFoundError:
    pass

memo = {}
def f(p, r, g, b):
    if (p, r, g, b) in memo: return memo[p, r, g, b]
    if p == N or p == N+1:
        if r+g+b == 0: return 1
        return 0
    if p > N:
        return 0

    w = (r+g+b) // 2
    if p+r+g+b+w-1 > N: return 0

    res = 0
    res += f(p+1, r, g, b)
    res %= MOD

    if r > 0:
        res += f(p+2, r-1, g, b)
        res %= MOD
    if g > 0:
        res += f(p+2, r, g-1, b)
        res %= MOD
    if b > 0:
        res += f(p+2, r, g, b-1)
        res %= MOD

    if r > 0 and g > 0:
        res += 2 * f(p+3, r-1, g-1, b)
        res %= MOD
    if g > 0 and b > 0:
        res += 2 * f(p+3, r, g-1, b-1)
        res %= MOD
    if r > 0 and b > 0:
        res += 2 * f(p+3, r-1, g, b-1)
        res %= MOD

    memo[p, r, g, b] = res
    return res


ans = f(0, R, G, B)
print(ans)