#include #define rep(i, a, n) for(int i = a; i < n; i++) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define o(a) cout << a << endl #define int long long #define fi first #define se second using namespace std; typedef pair P; const int mod = 1e9 + 7; long long mod_pow(long long x, long long n){ if(n == 0) return 1; long long res = mod_pow(x*x % mod, n / 2); if(n & 1) res = res*x % mod; return res; } signed main(){ int n; cin >> n; int ans = 1; rep(i, 1, 2 * n + 1){ ans = (ans * i) % mod; } // cout << ans << endl; ans = (ans * mod_pow(mod_pow(2, n % 20), mod - 2)) % mod; rep(i, 0, n / 20){ ans = (ans * mod_pow(1048576, mod - 2)) % mod; } cout << ans << endl; }