#include <bits/stdc++.h>
using namespace std;

#define MOD 1000000007

int n;
int memo[1000010][10];

int dfs(int i, int j){
  if(i == n){
    return 1;
  }

  if(memo[i][j] != -1) return memo[i][j];

  long long ans = 0;
  for(int k = j;k <= 9;k++){
    ans = (ans + dfs(i+1,k)) % MOD;
  }

  return memo[i][j] = ans;
}


int main(){
  cin >> n;
  memset(memo,-1,sizeof(memo));
  cout << dfs(0, 0) << endl;
  return 0;
}