#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <string>
#include <utility>
#include <queue>
#include <string>

#define reps(i,s,n) for(int (i) = (s); (i) < (n); (i)++)
#define rep(i,n) reps(i,0,n)
using namespace std;
using ll = long long;
const int mod = 1e9+7;

ll dp[1000002][10];

int main(){
    int n;
    cin >> n;
    rep(i,10) dp[1][i] = 1;

    rep(i,n+1){
        rep(j,10){
            rep(k,j+1){
                dp[i+1][k] = (dp[i][j] + dp[i+1][k]) % mod;
            }
        }
    }

    ll ans = 0;
    rep(i,10){
        ans = (ans + dp[n][i]) % mod;
    }
    cout << ans << endl;

    return 0;
}