#include "bits/stdc++.h" #define REP(i, n, N) for(ll i=(n); i<(N); i++) #define RREP(i, n, N) for(ll i=(N-1); i>=n; i--) #define CK(n, a, b) ((a)<=(n)&&(n)<(b)) #define ALL(v) (v).begin(),(v).end() #define MCP(a, b) memcpy(b,a,sizeof(b)) #define p(s) cout<<(s)<> typedef long long ll; using namespace std; const ll mod = 1e9 + 7; const ll inf = 1e18; ll N; ll ans; ll dp[1000010][10]; int main() { cin>>N; dp[0][0]=1; REP(i,0,N){ REP(j,0,10){ REP(k,j,10){ dp[i+1][k] += dp[i][j]; dp[i+1][k] %= mod; } } } REP(i,0,10){ ans += dp[N][i]; ans %= mod; } p(ans); return 0; }