#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const ll MOD = 1000000007;
ll dp[1000010][10];

int main() {
  int N;
  cin >> N;
  memset(dp, 0, sizeof(dp));

  for (int i = 1; i <= N; ++i) {
    for (int j = 0; j <= 9; ++j) {
      if (j != 0 || i == N) dp[i][j]++;

      for (int k = 1; k <= j; ++k) {
        dp[i][j] += dp[i - 1][k];
        dp[i][j] %= MOD;
      }
    }
  }

  ll ans = 0;

  for (int i = 0; i <= 9; ++i) {
    ans += dp[N][i];
    ans %= MOD;
  }

  cout << ans << endl;

  return 0;
}