#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define ll long long #define ld long double #define EPS 0.0000000001 #define INF 1e9 #define LINF (ll)INF*INF #define MOD 1000000007 #define rep(i,n) for(int i=0;i<(n);i++) #define loop(i,a,n) for(int i=a;i<(n);i++) #define all(in) in.begin(),in.end() #define shosu(x) fixed< vi; typedef vector vs; typedef pair pii; typedef vector vp; int gcd(int a, int b){ if(b==0) return a; return gcd(b,a%b); } int lcm(int a, int b){ return a/gcd(a,b)*b; } long long beki(long long a,int n) { long long s=1LL; while(n){ if(n%2)s=(s*a)%MOD; a=(a*a)%MOD; n/=2; } return s; } signed main(void) { int n; cin >> n; int ans = 4*beki(10,n) - 1; cout << (ans/3)%MOD << endl; }