#pragma GCC optimize("O3")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")	
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping") 
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma") 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") 
//#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

const long long int MOD = 1e9 + 7;
long long int f[400005];
long long int invf[400005];
long long int mypow(long long int x,long long int n)
{
    long long int res = 1;
    while(n > 0)
    {
        if(n%2==1)
        {
            res*=x;
            res%=MOD;
        }
        x*=x;
        x%=MOD;
        n/=2;
    }
    return res;
}

int main(void) 
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    long long int n;
    long long int res = 0;

    cin >> n;

    long long int m = (n/2) + 1;

    f[0] = 1;
    for(int i=1;i<=400000;i++)
    {
        f[i] = f[i-1]*i;
        f[i]%=MOD;
    }

    invf[400000] = mypow(f[400000],MOD-2);
    for(int i=399999;i>=0;i--)
    {
        invf[i] = invf[i+1]*(i+1);
        invf[i]%=MOD;
    }

    for(long long int i=1;i<=m;i++)
    {
        if(i==1)
        {
            res += 1;
            res%=MOD;
        }
        else if(i==2)
        {
            res += n;
            res%=MOD;
        }
        else
        {
            long long int len = i - 1;
            long long int L = i;
            long long int R = i + len - 2;
            //cout << L << ' ' << R << '\n';
            long long int temp = f[n+R];
            temp*=invf[n+L-1];
            temp%=MOD;
            temp*=n;
            temp%=MOD;
            temp*=invf[len];
            temp%=MOD;
            res += temp;
            res%=MOD;
        }
    }

    cout << res << '\n';
    return 0;
}