n,a,b = map(int,input().split())

mod = 10**9+7

ans = 1
r = 2
m = n
while(True):
    if(m%2 == 1):
        ans *= r
        ans %= mod
    r = r**2
    r %= mod
    m = m//2
    if(m == 0):
        break

a = max(a,n-a)
b = max(b,n-b)
base = []
rbase = [0,1]
c = min(a,b)
d = max(a,b)

bas = 1
for i in range(n,c,-1):
    bas *= i
    bas %= mod
    base.append(bas)

#0からn-cまでの逆元
rbase = [0,1]
for i in range(2,n-c+1):
    q = mod//i
    r = mod % i
    rbase.append(-q * rbase[r] % mod)
rbases = []
rbas = 1
for i in range(1,n-c+1):
    rbas *= rbase[i]
    rbas %= mod
    rbases.append(rbas)

a_ = base[n-c-1]*rbases[n-c-1]%mod
if(d == n):
    b_ = 1
else:
    b_ = base[n-d-1]*rbases[n-d-1]%mod
print((ans - a_ - b_ - 1)%mod) 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 ans = 1 ans 1 r = 2 r 2 m = n m n while(True):
    if(m%2 == 1):
        ans *= r
        ans %= mod
    r = r**2
    r %= mod
    m = m//2
    if(m == 0):
        break True if(m%2 == 1):
        ans *= r
        ans %= mod
     m%2 == 1 m%2 m 2 1 ans *= r ans r ans %= mod ans mod r = r**2 r r**2 r 2 r %= mod r mod m = m//2 m m//2 m 2 if(m == 0):
        break m == 0 m 0 break a = max(a,n-a) a max(a,n-a) max a n-a n a b = max(b,n-b) b max(b,n-b) max b n-b n b base = [] base [] rbase = [0,1] rbase [0,1] 0 1 c = min(a,b) c min(a,b) min a b d = max(a,b) d max(a,b) max a b bas = 1 bas 1 for i in range(n,c,-1):
    bas *= i
    bas %= mod
    base.append(bas)

#0からn-cまでの逆元 i range(n,c,-1) range n c -1 bas *= i bas i bas %= mod bas mod base.append(bas) base.append base append bas rbase = [0,1] rbase [0,1] 0 1 for i in range(2,n-c+1):
    q = mod//i
    r = mod % i
    rbase.append(-q * rbase[r] % mod) i range(2,n-c+1) range 2 n-c+1 n-c n c 1 q = mod//i q mod//i mod i r = mod % i r mod % i mod i rbase.append(-q * rbase[r] % mod) rbase.append rbase append -q * rbase[r] % mod -q * rbase[r] -q q rbase[r] rbase r mod rbases = [] rbases [] rbas = 1 rbas 1 for i in range(1,n-c+1):
    rbas *= rbase[i]
    rbas %= mod
    rbases.append(rbas) i range(1,n-c+1) range 1 n-c+1 n-c n c 1 rbas *= rbase[i] rbas rbase[i] rbase i rbas %= mod rbas mod rbases.append(rbas) rbases.append rbases append rbas a_ = base[n-c-1]*rbases[n-c-1]%mod a_ base[n-c-1]*rbases[n-c-1]%mod base[n-c-1]*rbases[n-c-1] base[n-c-1] base n-c-1 n-c n c 1 rbases[n-c-1] rbases n-c-1 n-c n c 1 mod if(d == n):
    b_ = 1
else:
    b_ = base[n-d-1]*rbases[n-d-1]%mod d == n d n b_ = 1 b_ 1 b_ = base[n-d-1]*rbases[n-d-1]%mod b_ base[n-d-1]*rbases[n-d-1]%mod base[n-d-1]*rbases[n-d-1] base[n-d-1] base n-d-1 n-d n d 1 rbases[n-d-1] rbases n-d-1 n-d n d 1 mod print((ans - a_ - b_ - 1)%mod) print (ans - a_ - b_ - 1)%mod ans - a_ - b_ - 1 ans - a_ - b_ ans - a_ ans a_ b_ 1 mod b = max(b,n-b) max(b,n-b) b ans *= r r ans ans = 1 1 ans rbas = 1 1 rbas bas = 1 1 bas rbase = [0,1] [0,1] rbase bas %= mod mod bas a = max(a,n-a) max(a,n-a) a b_ = 1 1 b_ r = r**2 r**2 r r = 2 2 r q = mod//i mod//i q base = [] [] base d = max(a,b) max(a,b) d rbases = [] [] rbases r = mod % i mod % i r bas *= i i bas rbase = [0,1] [0,1] rbase rbas *= rbase[i] rbase[i] rbas m = n n m a,b = map(int,input().split()) map(int,input().split()) a a_ = base[n-c-1]*rbases[n-c-1]%mod base[n-c-1]*rbases[n-c-1]%mod a_ ans %= mod mod ans n,a,b = map(int,input().split()) map(int,input().split()) n mod = 10**9+7 10**9+7 mod c = min(a,b) min(a,b) c b = map(int,input().split()) map(int,input().split()) b r %= mod mod r b_ = base[n-d-1]*rbases[n-d-1]%mod base[n-d-1]*rbases[n-d-1]%mod b_ rbas %= mod mod rbas m = m//2 m//2 m
n,a,b = map(int,input().split())

mod = 10**9+7

ans = 1
r = 2
m = n
while(True):
    if(m%2 == 1):
        ans *= r
        ans %= mod
    r = r**2
    r %= mod
    m = m//2
    if(m == 0):
        break

a = max(a,n-a)
b = max(b,n-b)
base = []
rbase = [0,1]
c = min(a,b)
d = max(a,b)

bas = 1
for i in range(n,c,-1):
    bas *= i
    bas %= mod
    base.append(bas)

#0からn-cまでの逆元
rbase = [0,1]
for i in range(2,n-c+1):
    q = mod//i
    r = mod % i
    rbase.append(-q * rbase[r] % mod)
rbases = []
rbas = 1
for i in range(1,n-c+1):
    rbas *= rbase[i]
    rbas %= mod
    rbases.append(rbas)

a_ = base[n-c-1]*rbases[n-c-1]%mod
if(d == n):
    b_ = 1
else:
    b_ = base[n-d-1]*rbases[n-d-1]%mod
print((ans - a_ - b_ - 1)%mod)
