#include<iostream>
#include <algorithm>
#include <functional>
#include<vector>
#include<math.h>
#include<bitset>
#include<string>
#include <deque>
#include<queue>
#include <iomanip>
#include<map>
#include <random>
#include<type_traits>
#include<stack>
#include <sstream> 
#include <limits>
#include <numeric>
#include<string.h>
using namespace std;
#define ll long long int
#define all(v) begin(v), end(v)
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for(int i = (int)(s); i < (int)(n); i++)
//typedef vector<int> V;
//typedef vector<V> VV;
//typedef vector<VV> VVV;
using namespace std;


long long int dp[1000005][10];

long long int solve(long long int N) {
	for (int i = 0; i < 10; i++) {
		dp[1][i] = 1;
	}
	for(long long int i = 1; i < N; i++) {
		long long int sum = 0;
		for (int j = 9; j>=0; j--) {
			sum += dp[i][j];
			sum %= 1000000007;
			dp[i + 1][j] = sum;
		}
	}
	long long int res = 0;
	for (int i = 0; i < 10; i++) {
		res += dp[N][i];
	}
	return res%1000000007;
}

int main() {
	int N;
	cin >> N;
	cout<<solve(N)<<endl;
}