#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define all(c) begin(c),end(c)

template<typename T1, typename T2>
inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }

template<typename T1, typename T2>
inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }

//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30) - 1
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007


//ここから編集する
ll gcd(ll a, ll b) {
    if (a < b) swap(a, b);
    if (a % b == 0) return b;
    return gcd(b, a % b);

}


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

    vector<ll> mul;
    int N;
    cin >> N;

    for (ll i = N + 1; i <= N + 9; ++i) {
        mul.push_back(i);
    }
    for (int i = 2; i <= 9; ++i) {
        ll tmp = i;
        for (auto &e : mul) {
//            if(e % i == 0){
//                e /= i;
//                break;
//            }
            ll tmp2 = gcd(tmp, e);
            tmp /= tmp2;
            e /= tmp2;
        }
    }

    ll ans = 1ll;
    for (auto e : mul) {
        ans *= e;
        ans %= MOD;
    }

    cout << ans << endl;
    return 0;
}