#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>
#include <atcoder/all>

#include <bits/stdc++.h>


#define rep(i,n) for (int i = 0; i < (n); ++i)
using namespace atcoder;
using namespace std;
typedef long long int ll;
typedef modint1000000007 mint;




ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;

    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

/*
解説動画参考
解説ブログ参考

*/


mint dp[1000200][10];
int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    
    while (Q--) {
        int n;
        cin >> n;
        
        for (int i = 0; i < 10; i++)dp[1][i] = 1;
        for (int i = 1; i < n; i++)for (int j = 0; j < 10; j++) {
            for (int k = j; k < 10; k++)dp[i + 1][k] += dp[i][j];
        }
        mint ans = 0;
        for (int i = 0; i < 10; i++)ans += dp[n][i];
        cout << ans.val() << endl;
    }

    return 0;
}