#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
using ll = long long;
using pii = pair<int,int>;
ll mod = 1000000007;
ll mod_pow(ll a, ll b){
    if(b==0)return 1;
    if(b==1)return a;
    ll res = mod_pow(a,b/2);
    res = res * res % mod;
    if(b%2)res = res * a;
    return res % mod;
}
int main(){
    ll n;
    cin >> n;
    cout << (4*mod_pow(10,n)%mod-1+mod)%mod*mod_pow(3,mod-2)%mod << endl;
}