#include using namespace std; #define rep(i, n) for (int i = 0; i < (n); ++i) using ll = long long; const char sp = ' '; const char cmm = ','; const int MOD = 1e9+7; const int INF = 1e9; const ll LINF = 1e18; ll mod(ll a, ll b){return (a%b+b)%b;} ll gcd(ll a, ll b){return b?gcd(b,a%b):a;} ll lcm(ll a, ll b){return a*b/gcd(a,b);} void Yes(){cout << "Yes" << endl;} void No(){cout << "No" << endl;} void Judge(bool b){b?Yes():No();} void YES(){cout << "YES" << endl;} void NO(){cout << "NO" << endl;} void JUDGE(bool b){b?YES():NO();} ll powMod(ll b, ll e, ll m){ll r=1;while(e>0){if(e&1)r=(r%m)*(b%m)%m;b=(b%m)*(b%m)%m;e>>=1;}return r;} double distance(ll x1, ll y1, ll x2, ll y2){return sqrt((x1-x2)*(x1-x2) + (y1-y2)*(y1-y2));} template void ppp(T n){cout << n << endl;} template ostream& operator<<(ostream& s, const pair& p) {return s << "(" << p.first << ", " << p.second << ")";} template ostream& operator<<(ostream& s, const vector& v) { int len = v.size(); s << '['; for (int i = 0; i < len; ++i) { s << v[i]; if (i < len-1) s << ", "; } s << ']'; return s; } int main(){ cin.tie(0); ios::sync_with_stdio(false); ll n; cin >> n; ll ans = 0; ll tmp = 0; ans += powMod(10, n, MOD); for(int i = 0; i < n; ++i){ tmp += powMod(10, i, MOD); tmp %= MOD; } ans += 3*tmp; ans %= MOD; ppp(ans); return 0; }