#include "bits/stdc++.h"

using namespace std;

const int MOD = 1e9 + 7;

void solve(void)
{
	int n;
	cin >> n;
	vector<int> dp(10);
	dp[0] = 1;
	while (n--)
	{
		vector<int> nx(dp);
		for (int i = 1; i < 10; i++)
		{
			nx[i] += nx[i - 1];
			nx[i] %= MOD;
		}
		swap(dp, nx);
	}
	int ans = 0;
	for (int i = 0; i < 10; i++)
	{
		ans += dp[i];
		ans %= MOD;
	}
	cout << ans << endl;
}

int main()
{
	solve();
	//cout << "yui(*-v・)yui" << endl;
	return 0;
}