#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
const long long INF = 1LL << 60;
const int MOD = 1000000007;
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
int solve(int n){
    if(n < 18){
        int x = (int)pow(10, n) % MOD;
        return x;
    }
    if(n %2 == 1) return solve(n-1) % MOD*10 % MOD;
    else{
        int x = solve(n/2) % MOD;
        return x*x % MOD;
    }
}
signed main(void){
    int n; cin>>n;
    int ten_N = solve(n);
    //cout<<ten_N<<endl;
    cout<<(ten_N + 3*(ten_N -1)/(10-1)) % MOD<<endl;
}