#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
   
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k>0){
        if(k%2==1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k/=2;
    }
    return ans;
}
ll inv(ll a){
	return powmod(a, MOD-2);
}
int main()
{
	int n;
	cin>>n;
	ll f1=1, f=1;
	for(ll i=1; i<=9+n; i++){
		f*=i; f%=MOD;
	}
	for(ll i=1; i<=n; i++){
		f1*=i; f1%=MOD;
	}
	cout<<f*inv(f1)%MOD*inv(362880ll)%MOD<<endl;
    return 0;
}