N, A, B, C = map(int, input().split())

def func(n):
    return n.bit_length() == n.bit_count()

A, B, C = sorted([A, B, C])

if not func(A) and not func(B) and not func(C):
    print(N)
elif (not func(B) or A != B-1) and (not func(C) or B != C-1):
    ans = N
    for n in [A, B, C]:
        if func(n):
            a = 1<<n.bit_length()
            b = 1<<(n.bit_length()-1)
            if b <= N:
                ans -= (N-b)//a+1
    print(ans)
elif [A, B, C] != [1, 2, 3]:
    ans = N
    size = C.bit_length()
    n = 0
    if 2**(size-1) < N:
        r = N-2**(size-1)-1
        n += (2**(size-1)+1)*(r//2**size)
        a = r%2**size
        n += a//2+1
        if a == 2**size-1:
            n += 1
        N = 2**(size-1)
    N -= 1
    n += N//2+1
    if N == 2**(size-1)-1:
        n += 1
    print(ans-n)
else:
    print(N//4)