#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
#include <cassert>
#include <complex>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
const int inf = 1e8;


ll dp[1000100][2][10];

int main() {
    int n;
    cin>>n;
    dp[0][0][0]=1;
    for(int i=0;i<=n;i++){
        int x = ((i==0)?1:0);
        for(int k=0;k<10;k++){
            for(int l=k;l<10;l++){
                if(l==x)dp[i+1][0][l] = (dp[i+1][0][l]+dp[i][0][k])%N;
                else{
                    dp[i+1][1][l] = (dp[i+1][1][l]+dp[i][0][k])%N;
                }
            }
        }
        for(int k=0;k<10;k++){
            for(int l=k;l<10;l++){
                if(l==x)dp[i+1][1][l] = (dp[i+1][1][l]+dp[i][1][k])%N;
                else{
                    dp[i+1][1][l] = (dp[i+1][1][l]+dp[i][1][k])%N;
                }
            }
        }
    }
    ll ans = 0;
    for(ll i=0;i<10;i++){
        ans = (ans+dp[n][1][i])%N;
        ans = (ans+dp[n][0][i])%N;
    }
    cout<<ans<<endl;
}