#include<iostream> #include<string> #include<cstdio> #include<vector> #include<cmath> #include<algorithm> #include<functional> #include<iomanip> #include<queue> #include<ciso646> #include<random> #include<map> #include<set> #include<complex> #include<bitset> #include<stack> #include<unordered_map> #include<utility> using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair<int, int> P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i<n;i++) #define per(i,n) for(int i=n-1;i>=0;i--) #define Rep(i,sta,n) for(int i=sta;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex<ld> Point; const ld eps = 1e-2; const ld pi = acos(-1.0); ll mod_pow(ll x, ll n) { ll res = 1; while (n) { if (n % 2)res = res * x%mod; x = x * x%mod; n >>= 1; } return res; } int main() { ll n; cin >> n; ll a = 4; a = a * mod_pow(10, n) % mod; a = (a - 1 + mod) % mod; a = a * (mod + 1) / 3 % mod; cout << a << endl; //stop return 0; }