#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>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}


int main(void){
    ll n;
    cin>>n;
    ll tmp = 1;
    ll ans = 0;
    for(ll i=0;i<=n;i++){
        if(i==n){
            ll t = tmp%N;
            tmp = (tmp*10)%N;
            ans = (ans+t)%N;
        }
        else{
            ll t = (tmp*3LL)%N;
            tmp = (tmp*10)%N;
            ans = (ans+t)%N;
        }
    }
    cout<<ans<<endl;
    return 0;
}