#include <bits/stdc++.h>
using namespace std;

// clang-format off
#define  range(i, l, r) for (int i = (int)(l); i < (int)(r); ++(i))
#define rrange(i, l, r) for (int i = (int)(r) - 1; i >= (int)(l); --(i))

#define  whole(f, x, ...) ([&](decltype((x)) container) { return (f)(  begin(container),  end(container), ## __VA_ARGS__); })(x)
#define rwhole(f, x, ...) ([&](decltype((x)) container) { return (f)( rbegin(container), rend(container), ## __VA_ARGS__); })(x)

#define endl '\n'
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl

using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;

// constexpr i32 mod   = 998244353;
constexpr i32 mod   = 1e9 + 7;
constexpr i32 inf   = 1001001001;
constexpr i64 infll = 1001001001001001001ll;

constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1}; 
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};

struct IoSetup { IoSetup(int x = 15){ cin.tie(0); ios::sync_with_stdio(0); cout << fixed << setprecision(x); cerr << fixed << setprecision(x); } } iosetup;

template <typename T = i64> T input() { T x; cin >> x; return x; }

template <typename T> ostream &operator<<(ostream &os, vector<T> &v) { range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); } return os; } 
template <typename T> istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }

template <typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
template <typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }

template <typename T> vector<T> make_vector(size_t a, T b) { return vector<T>(a, b); }
template <typename... Ts> auto make_vector(size_t a, Ts... ts) { return vector<decltype(make_vector(ts...))>(a, make_vector(ts...)); }

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }
// clang-format on

template < int mod >
class mod_int {

  int_fast32_t num_;

public:
  mod_int() : num_(0) {}
  mod_int(int_fast64_t num_) : num_(num_ >= 0 ? num_ % mod : (mod + num_ % mod) % mod) {}

  inline int_fast32_t num() const { return num_; }
  operator int_fast32_t() { return num_; }

  inline mod_int inverse() const {
    int_fast32_t a = num_, b = mod, u = 1, v = 0, t;
    while (b) { t = a / b; std::swap(a -= t * b, b); std::swap(u -= t * v, v); }
    return mod_int(u);
  }
 
  mod_int operator~() const { return inverse(); }
  mod_int operator+() const { return *this; }
  mod_int operator-() const { return mod_int(-num_); }

  mod_int &operator+=(const mod_int &rhs) { if ((num_ += rhs.num_) >= mod) num_ -= mod; return *this; }
  mod_int &operator-=(const mod_int &rhs) { if ((num_ -= rhs.num_) <  0)   num_ += mod; return *this; }
  mod_int &operator*=(const mod_int &rhs) { num_ = int_fast64_t(num_) * rhs.num_ % mod; return *this; }
  mod_int &operator/=(const mod_int &rhs) { return *this *= rhs.inverse(); }

  mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
  mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
  mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
  mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }

  bool operator==(const mod_int &rhs) const { return num_ == rhs.num_; }
  bool operator!=(const mod_int &rhs) const { return num_ != rhs.num_; }

  friend std::ostream &operator<<(std::ostream &os, const mod_int &rhs) {
    return os << rhs.num_;
  }

  friend std::istream &operator>>(std::istream &is, mod_int &rhs) {
    int_fast64_t num; is >> num; rhs = mod_int< mod >(num);
    return is;
  }

  friend mod_int pow(mod_int lhs, int_fast64_t rhs) {
    mod_int res(1);
    for (; rhs; rhs >>= 1) {
      if (rhs & 1) res *= lhs;
      lhs *= lhs;
    }
    return res;
  }
};

template< typename T >
T binomial(int64_t N, int64_t K) {
  if(K < 0 || N < K) return 0;
  T ret = 1;
  for(T i = 1; i <= K; i += 1) {
    ret *= N--;
    ret /= i;
  }
  return ret;
}

void solver() {
    int n = input(), a = input(), b = input();
    cout << pow(mod_int< mod >(2), n) - mod_int< mod >(1) - binomial< mod_int< mod > >(n, a) - binomial< mod_int< mod > >(n, b) << endl;
}

signed main(int argc, char *argv[]) {
    solver();
}


Measured memory_bytes: 764