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

#define MOD 1000000007

int f[1000020];

void init(){
  f[0] = 1;
  for(int i = 1;i < 1000020;i++){
    f[i] = (long long)f[i-1] * i % MOD;
  }
  return;
}

int pow_mod(long long n, long long m){
  long long ans = 1;
  while(m > 0){
    if(m & 1) ans = (ans * n) % MOD;
    n = (n * n) % MOD;
    m >>= 1;
  }
  return ans;
}

long long reverse(int i){
  return pow_mod(i,MOD-2);
}

int comb(int i, int j){
  return (long long)f[i] * reverse(f[i-j]) % MOD * reverse(f[j]) % MOD;
}

int main(){
  int n;
  cin >> n;
  init();
  cout << comb(n+9,9) << endl;
  return 0;
}