#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	vector<vector<int> > dp(N + 1, vector<int>(10, 0));
	dp[0][0] = 1;
	for (int i = 1; i <= N; i++) {
		for (int j = 0; j < 10; j++) {
			for (int k = j; k < 10; k++) {
				dp[i][k] = (dp[i][k] + dp[i - 1][j]) % MOD;
			}
		}
	}
	int res = 0;
	for (int i = 0; i < 10; i++) {
		res = (res + dp[N][i]) % MOD;
	}
	cout << res << endl;
}