func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long MOD = 1000 * 1000 * 1000 + 7;   long long mod(long long n) {     n %= MOD;     if (n < 0)       return n + MOD;     else       return n;   }   long long fp(long long a, long long p) {     long long ans = 1, c = a;     for (long long i = 0; (1ll << i) <= p; ++i) {       if ((p >> i) & 1) ans = mod(ans * c);       c = mod(c * c);     }     return ans;   }   long long dv(long long a, long long b) { return mod(a * fp(b, MOD - 2)); }   const long long N = 2e6 + 7;   long long first[N];   signed main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     first[0] = 1;     for (long long i = 1; i < N; ++i) first[i] = mod(first[i - 1] * i);     long long n;     cin >> n;     ++n;     long long a = mod(2 * first[2 * n - 1]);     long long b = mod(first[n] * first[n - 1]);     long long ans = mod(dv(a, b) - 1);     cout << ans <<   n ;   }   