#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define out(a) cout << a << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
const ll mod = (ll)(1e9+7);
template<class T> T power_mod(T a, T b) {return b ? power_mod(a * a % mod, b / 2) * (b % 2 ? a : 1) % mod : 1;}
ll abbb(int a, int b, ll n) {
    ll ret = 0;
    ret = b * (power_mod((ll)10, n) - 1);
    ret %= mod;
    ll tmp = power_mod((ll)9, mod - 2);
    tmp %= mod;
    (ret *= tmp) %= mod;
    (ret += a * power_mod((ll)10, n)) %= mod;
    return ret;
}
int main() {
    ll n; cin >> n;
    out(abbb(1, 3, n));
}