// includes {{{
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<map>
#include<set>
#include<tuple>
#include<cmath>
#include<random>
#include<cassert>
// }}}
// #include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;

int main() {
  std::ios::sync_with_stdio(false), std::cin.tie(0);
  int n;
  cin >> n;
  vector<ll> dp(10, 1);
  ll ans = 10;
  for(int i = 1; i < n; i++) {
    vector<ll> dps = dp;
    for(int j = 1; j < 10; j++) dps[j+1]=(dps[j+1]+dps[j])%mod;
    for(int j = 1; j <= 9; j++) {
      dp[j] = dps[j];
      ans += dp[j];
    }
  }
  ans %= mod;
  cout << ans << endl;
  return 0;
}