#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>

using namespace std;
typedef long long ll;

const int N=1e5+5,mod=1e9+7;

ll qpow(int a,int n)
{
    ll ret=1;
    while(n)
    {
        if(n&1) ret=ret*a%mod;
        a=(ll)a*a%mod;
        n>>=1;
    }
    return ret;
}

int main()
{
    int n;
    scanf("%d",&n);
    ll up=1,down=(n+1);
    for(int i=n*2,j=1;j<=n;j++,i--)
    {
        up=up*i%mod;
        down=down*j%mod;
    }
    cout<<up*qpow(down,mod-2)%mod<<endl;
    return 0;
}