n,a,b = map(int,input().split())
mod = 10**9 + 7
all = pow(2, n, mod)
if all == 0:
    all = 10**9 + 6
else:
    all -= 1

a = min(n-a,a)
b = min(n-b,b)

a_fact = 1
a_inv = 1
for i in range(1,a+1):
    a_fact *= (n-i+1)%mod
    a_inv *= pow(i,mod-2,mod)
    a_fact %= mod
    a_inv %= mod
nca = a_fact * a_inv
nca %= mod

b_fact = 1
b_inv = 1
for i in range(1,b+1):
    b_fact *= (n-i+1)%mod
    b_inv *= pow(i,mod-2,mod)
    b_fact %= mod
    b_inv %= mod
ncb = b_fact * b_inv
ncb %= mod

ans = all - nca - ncb

while ans < 0:
    ans += mod
if ans >= mod:
    ans -= mod
print(ans) n,a,b = map(int,input().split()) n map(int,input().split()) map int input().split() ().split () input split a b mod = 10**9 + 7 mod 10**9 + 7 10**9 10 9 7 all = pow(2, n, mod) all pow(2, n, mod) pow 2 n mod if all == 0:
    all = 10**9 + 6
else:
    all -= 1 all == 0 all 0 all = 10**9 + 6 all 10**9 + 6 10**9 10 9 6 all -= 1 all 1 a = min(n-a,a) a min(n-a,a) min n-a n a a b = min(n-b,b) b min(n-b,b) min n-b n b b a_fact = 1 a_fact 1 a_inv = 1 a_inv 1 for i in range(1,a+1):
    a_fact *= (n-i+1)%mod
    a_inv *= pow(i,mod-2,mod)
    a_fact %= mod
    a_inv %= mod i range(1,a+1) range 1 a+1 a 1 a_fact *= (n-i+1)%mod a_fact (n-i+1)%mod n-i+1 n-i n i 1 mod a_inv *= pow(i,mod-2,mod) a_inv pow(i,mod-2,mod) pow i mod-2 mod 2 mod a_fact %= mod a_fact mod a_inv %= mod a_inv mod nca = a_fact * a_inv nca a_fact * a_inv a_fact a_inv nca %= mod nca mod b_fact = 1 b_fact 1 b_inv = 1 b_inv 1 for i in range(1,b+1):
    b_fact *= (n-i+1)%mod
    b_inv *= pow(i,mod-2,mod)
    b_fact %= mod
    b_inv %= mod i range(1,b+1) range 1 b+1 b 1 b_fact *= (n-i+1)%mod b_fact (n-i+1)%mod n-i+1 n-i n i 1 mod b_inv *= pow(i,mod-2,mod) b_inv pow(i,mod-2,mod) pow i mod-2 mod 2 mod b_fact %= mod b_fact mod b_inv %= mod b_inv mod ncb = b_fact * b_inv ncb b_fact * b_inv b_fact b_inv ncb %= mod ncb mod ans = all - nca - ncb ans all - nca - ncb all - nca all nca ncb while ans < 0:
    ans += mod ans < 0 ans 0 ans += mod ans mod if ans >= mod:
    ans -= mod ans >= mod ans mod ans -= mod ans mod print(ans) print ans b_fact %= mod mod b_fact b_inv *= pow(i,mod-2,mod) pow(i,mod-2,mod) b_inv a_inv = 1 1 a_inv nca %= mod mod nca ncb = b_fact * b_inv b_fact * b_inv ncb b_fact = 1 1 b_fact ans -= mod mod ans mod = 10**9 + 7 10**9 + 7 mod b = map(int,input().split()) map(int,input().split()) b a_fact = 1 1 a_fact b_inv %= mod mod b_inv n,a,b = map(int,input().split()) map(int,input().split()) n a_fact *= (n-i+1)%mod (n-i+1)%mod a_fact a_fact %= mod mod a_fact a_inv %= mod mod a_inv nca = a_fact * a_inv a_fact * a_inv nca all = pow(2, n, mod) pow(2, n, mod) all b_fact *= (n-i+1)%mod (n-i+1)%mod b_fact ans = all - nca - ncb all - nca - ncb ans all -= 1 1 all b = min(n-b,b) min(n-b,b) b ans += mod mod ans ncb %= mod mod ncb b_inv = 1 1 b_inv a,b = map(int,input().split()) map(int,input().split()) a all = 10**9 + 6 10**9 + 6 all a_inv *= pow(i,mod-2,mod) pow(i,mod-2,mod) a_inv a = min(n-a,a) min(n-a,a) a
n,a,b = map(int,input().split())
mod = 10**9 + 7
all = pow(2, n, mod)
if all == 0:
    all = 10**9 + 6
else:
    all -= 1

a = min(n-a,a)
b = min(n-b,b)

a_fact = 1
a_inv = 1
for i in range(1,a+1):
    a_fact *= (n-i+1)%mod
    a_inv *= pow(i,mod-2,mod)
    a_fact %= mod
    a_inv %= mod
nca = a_fact * a_inv
nca %= mod

b_fact = 1
b_inv = 1
for i in range(1,b+1):
    b_fact *= (n-i+1)%mod
    b_inv *= pow(i,mod-2,mod)
    b_fact %= mod
    b_inv %= mod
ncb = b_fact * b_inv
ncb %= mod

ans = all - nca - ncb

while ans < 0:
    ans += mod
if ans >= mod:
    ans -= mod
print(ans)