n, a, b = map(int, input().split())
mod = 10**9+7

def cmb2(n, r, mod):
    res = 1
    temp = 1
    for k in range(1, r+1):
        res *= (n-k+1)
        temp *= k
        res %= mod
        temp %= mod
    res *= pow(temp,(mod-2),mod)
    res %= mod
    return res

def power(a, n, mod):
    bi=str(format(n,"b")) #2進数
    res=1
    for i in range(len(bi)):
        res=(res*res) %mod
        if bi[i]=="1":
            res=(res*a) %mod
    return res

ans = power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) -1
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 def cmb2(n, r, mod):
    res = 1
    temp = 1
    for k in range(1, r+1):
        res *= (n-k+1)
        temp *= k
        res %= mod
        temp %= mod
    res *= pow(temp,(mod-2),mod)
    res %= mod
    return res cmb2 res = 1 res 1 temp = 1 temp 1 for k in range(1, r+1):
        res *= (n-k+1)
        temp *= k
        res %= mod
        temp %= mod
     k range(1, r+1) range 1 r+1 r 1 res *= (n-k+1) res n-k+1 n-k n k 1 temp *= k temp k res %= mod res mod temp %= mod temp mod res *= pow(temp,(mod-2),mod) res pow(temp,(mod-2),mod) pow temp mod-2 mod 2 mod res %= mod res mod return res res n n r r mod mod def power(a, n, mod):
    bi=str(format(n,"b")) #2進数
    res=1
    for i in range(len(bi)):
        res=(res*res) %mod
        if bi[i]=="1":
            res=(res*a) %mod
    return res power bi=str(format(n,"b")) bi str(format(n,"b")) str format(n,"b") format n "b" res=1 res 1 for i in range(len(bi)):
        res=(res*res) %mod
        if bi[i]=="1":
            res=(res*a) %mod
     i range(len(bi)) range len(bi) len bi res=(res*res) %mod res (res*res) %mod res*res res res mod if bi[i]=="1":
            res=(res*a) %mod
     bi[i]=="1" bi[i] bi i "1" res=(res*a) %mod res (res*a) %mod res*a res a mod return res res a a n n mod mod ans = power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) -1 ans power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) -1 power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) power(2, n, mod) - cmb2(n, a, mod) power(2, n, mod) power 2 n mod cmb2(n, a, mod) cmb2 n a mod cmb2(n, b, mod) cmb2 n b mod 1 ans %= mod ans mod print(ans) print ans n, a, b = map(int, input().split()) map(int, input().split()) n mod = 10**9+7 10**9+7 mod def power(a, n, mod):
    bi=str(format(n,"b")) #2進数
    res=1
    for i in range(len(bi)):
        res=(res*res) %mod
        if bi[i]=="1":
            res=(res*a) %mod
    return res def power(a, n, mod):
    bi=str(format(n,"b")) #2進数
    res=1
    for i in range(len(bi)):
        res=(res*res) %mod
        if bi[i]=="1":
            res=(res*a) %mod
    return res power ans %= mod mod ans def cmb2(n, r, mod):
    res = 1
    temp = 1
    for k in range(1, r+1):
        res *= (n-k+1)
        temp *= k
        res %= mod
        temp %= mod
    res *= pow(temp,(mod-2),mod)
    res %= mod
    return res def cmb2(n, r, mod):
    res = 1
    temp = 1
    for k in range(1, r+1):
        res *= (n-k+1)
        temp *= k
        res %= mod
        temp %= mod
    res *= pow(temp,(mod-2),mod)
    res %= mod
    return res cmb2 ans = power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) -1 power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) -1 ans b = map(int, input().split()) map(int, input().split()) b a, b = map(int, input().split()) map(int, input().split()) a
n, a, b = map(int, input().split())
mod = 10**9+7

def cmb2(n, r, mod):
    res = 1
    temp = 1
    for k in range(1, r+1):
        res *= (n-k+1)
        temp *= k
        res %= mod
        temp %= mod
    res *= pow(temp,(mod-2),mod)
    res %= mod
    return res

def power(a, n, mod):
    bi=str(format(n,"b")) #2進数
    res=1
    for i in range(len(bi)):
        res=(res*res) %mod
        if bi[i]=="1":
            res=(res*a) %mod
    return res

ans = power(2, n, mod) - cmb2(n, a, mod) - cmb2(n, b, mod) -1
ans %= mod
print(ans)
