#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <string>
#include <algorithm>
#include <sstream>
#include <climits>
#include <fstream>
#include <cmath>

using namespace std;

/// ********* debug template by Bidhan Roy *********

template < typename F, typename S >
ostream& operator << ( ostream& os, const pair< F, S > & p ) {
    return os << "(" << p.first << ", " << p.second << ")";
}

template < typename T >
ostream &operator << ( ostream & os, const vector< T > &v ) {
    os << "{";
    typename vector< T > :: const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "}";
}

template < typename T >
ostream &operator << ( ostream & os, const set< T > &v ) {
    os << "[";
    typename set< T > :: const_iterator it;
    for ( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "]";
}

template < typename T >
ostream &operator << ( ostream & os, const unordered_set< T > &v ) {
    os << "[";
    typename unordered_set< T > :: const_iterator it;
    for ( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << *it;
    }
    return os << "]";
}

template < typename F, typename S >
ostream &operator << ( ostream & os, const map< F, S > &v ) {
    os << "[";
    typename map< F , S >::const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << it -> first << ": " << it -> second ;
    }
    return os << "]";
}

template < typename F, typename S >
ostream &operator << ( ostream & os, const unordered_map< F, S > &v ) {
    os << "[";
    typename unordered_map< F , S >::const_iterator it;
    for( it = v.begin(); it != v.end(); it++ ) {
        if( it != v.begin() ) os << ", ";
        os << it -> first << ": " << it -> second ;
    } 
    return os << "]";
}

#define debug(x) cerr << #x << " = " << x << endl;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<VB> VVB;
typedef vector<VI> VVI;
typedef vector<VC> VVC;
typedef vector<VLL> VVLL;
typedef vector<VD> VVD;
typedef vector<VS> VVS;
typedef vector<PII> VPII;

// TEMPLATE DEFINITIONS END

LL n, a, b;
LL MOD = 1000000007;

// LL power(LL x, LL y, LL p) 
// { 
//     LL res = 1;      // Initialize result 
  
//     x = x % p;  // Update x if it is more than or 
//                 // equal to p 
  
//     while (y > 0) 
//     { 
//         // If y is odd, multiply x with result 
//         if (y & 1) 
//             res = (res*x) % p; 
  
//         // y must be even now 
//         y = y>>1; // y = y/2 
//         x = (x*x) % p; 
//     } 
//     return res; 
// } 
LL power(LL x, LL y, LL p){

    if(y == 1) return x;

    LL rez = power(x, y/2, p);
    rez = (rez * rez) % p;
    if(y % 2) rez = (rez * x) % p;
    return rez;
}
  
// Returns n^(-1) mod p 
LL modInverse(LL n, LL p){
    return power(n, p-2, p);
}

LL nCrModPFermat(LL n, LL r){ 
    if (r==0) 
        return 1; 

    LL fac_n = 1, fac_r = 1;
    for(LL i=n-r+1;i<=n;i++) fac_n = (fac_n * i) % MOD;
    for(LL i=1;i<=r;i++) fac_r = (fac_r * i) % MOD;

    return fac_n * modInverse(fac_r, MOD) % MOD;
}

void read_input(){
    cin >> n >> a >> b;
}

void solve(){
    
    // debug(power(2, n, MOD));
    // debug(nCrModPFermat(n, a, MOD));
    // debug(nCrModPFermat(n, b, MOD));
    LL solution = power(2, n, MOD) - 1;
    LL nCrA = nCrModPFermat(n, a);
    LL nCrB = nCrModPFermat(n, b);
    
    solution -= nCrA;
    if(solution < 0) solution += MOD;
    
    solution -= nCrB;
    if(solution < 0) solution += MOD;
    
    cout << solution << "\n";
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    read_input();
    solve();
    return 0;
}

Measured memory_bytes: 256