#include <iostream>
#include <vector>
#include <algorithm>

//ModInt
//#include <vector>
template<long long M>
struct modint {
	long long val;

	void sub(long long &n) {
		if (n < 0) {
			long long m = (-n) % M;
			n = M - m;
		}
		else n %= M;
	}

	//コンストラクタ
	modint<M>(long long right) : val(right) {sub(val);}

	modint<M> operator+ (modint<M> right) {
		modint<M> ret = (this -> val) + right.val;
		return ret;
	}
	modint<M> operator+ (long long right) {
		sub(right);
		modint<M> ret = (this -> val) + right;
		return ret;
	}
	modint<M> operator- (modint<M> right) {
		modint<M> ret = (this -> val) - right.val;
		return ret;
	}
	modint<M> operator- (long long right) {
		sub(right);
		modint<M> ret = (this -> val) - right;
		return ret;
	}
	modint<M> operator* (modint<M> right) {
		modint<M> ret = (this -> val) * right.val;
		return ret;
	}
	modint<M> operator* (long long right) {
		sub(right);
		modint<M> ret = (this -> val) * right;
		return ret;
	}

	bool operator== (modint<M> right) {return ((this -> val) == right.val);}
	bool operator== (long long right) {sub(right); return ((this -> val) == right);}
	bool operator!= (modint<M> right) {return ((this -> val) != right.val);}
	bool operator!= (long long right) {sub(right); return ((this -> val) != right);}
	bool operator<= (modint<M> right) {return ((this -> val) <= right.val);}
	bool operator<= (long long right) {sub(right); return ((this -> val) <= right);}
	bool operator>= (modint<M> right) {return ((this -> val) >= right.val);}
	bool operator>= (long long right) {sub(right); return ((this -> val) >= right);}
	bool operator< (modint<M> right) {return ((this -> val) < right.val);}
	bool operator< (long long right) {sub(right); return ((this -> val) < right);}
	bool operator> (modint<M> right) {return ((this -> val) > right.val);}
	bool operator> (long long right) {sub(right); return ((this -> val) > right);}

	void operator+= (modint<M> right) {*this = *this + right;}
	void operator+= (long long right) {*this = *this + right;}
	void operator-= (modint<M> right) {*this = *this - right;}
	void operator-= (long long right) {*this = *this - right;}
	void operator*= (modint<M> right) {*this = *this * right;}
	void operator*= (long long right) {*this = *this * right;}

	modint<M>& operator++ () {
		*this += 1;
		return *this - 1;
	}
	modint<M> operator++ (int) {
		*this += 1;
		return *this;
	}
	modint<M>& operator-- () {
		*this -= 1;
		return *this + 1;
	}
	modint<M> operator-- (int) {
		*this -= 1;
		return *this;
	}

	long long modinv(long long n, long long p) {
		long long a = p, u = 1, v = 0;
		while (a) {
			long long t = n / a;
			n -= t * a;
			std::swap(n, a);
			u -= t * v;
			std::swap(u, v);
		}
		u %= p;
		if (u < 0) u += p;
		return u;
	}

	modint<M> operator/ (modint<M> right) {
		modint<M> ret = *this * modinv(right.val, M);
		return ret;
	}
	modint<M> operator/ (long long right) {
		sub(right);
		modint<M> ret = *this * modinv(right, M);
		return ret;
	}

	void operator/= (modint<M> right) {*this = *this / right;}
	void operator/= (long long right) {*this = *this / right;}
};

template<long long M>
long long modpow(long long a, long long n) {
	a %= M;
	if (a == 0) return 0;
	if (a == 1) return 1;
	long long b = 1, cnt = 0;
	while (b < M && cnt < n) {
		b *= a;
		cnt++;
	}
	if (b < M) return b;
	b %= M;
	return modpow<M>(b, n / cnt) * modpow<M>(a, n % cnt) % M;
}

std::vector<long long> factorial;
std::vector<long long> factorial_inv;

template<long long M>
void make_table(long long n) {
	factorial.resize(n + 1, 1);
	factorial_inv.resize(n + 1, 1);
	for (long long i = 2; i <= n; i++) {
		factorial[i] = factorial[i - 1] * i % M;
	}
	factorial_inv[n] = modpow<M>(factorial[n], M - 2);
	for (long long i = n - 1; i > 0; i--) {
		factorial_inv[i] = factorial_inv[i + 1] * (i + 1) % M;
	}
}

template<long long M>
modint<M> combination(long long n, long long r) {
	r = std::min(r, n - r);
	if (n <= factorial.size()) {
		modint<M> a = factorial[n], b = factorial_inv[r], c = factorial_inv[n - r];
		return a * b * c;
	}
	else {
		std::cerr << "attention: factorial table is not constructed." << std::endl;
		modint<M> ret = 1;
		for (long long i = 0; i < r; i++) {
			ret *= n - i;
			ret *= modpow<M>(i + 1, M - 2);
		}
		return ret;
	}
}

template<long long M>
std::ostream &operator<< (std::ostream &out, modint<M> tgt) {out << tgt.val; return out;}

int main() {
	const long long p = 1e9 + 7;

	long long n, a, b;
	std::cin >> n >> a >> b;

	modint<p> ans = modpow<p>(2, n) - 1;
	ans -= combination<p>(n, a) + combination<p>(n, b);
	std::cout << ans << std::endl;
}


Measured memory_bytes: 256