#include typedef long long int ll; using namespace std; ll n, dp[1010101][10]; ll mod = 1e9 + 7; int main() { ios::sync_with_stdio(false); cin >> n;// 1 < = 𝑁< = 1000000 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 next = j; next < 10; next++) { dp[i+1][next] += dp[i][j]%mod; } } } ll ans = 0; for (int i = 0; i < 10; i++) ans = (ans%mod + dp[n][i]%mod)%mod; return 0; }