#include <iostream>
using namespace std;
constexpr int M = 1000000007;
int modexp(int x, long long e, int m) {
    long long ans = 1, p = x % m;
    while (e > 0) {
        if (e % 2 != 0) ans = (ans * p) % m;
        p = (p * p) % m;
        e >>= 1;
    }
    return ans;
}

int main() {
    long long n; cin >> n;
    long long x = modexp(10, n, M);
    cout << (x + (x-1) * (M+1) / 3) % M << endl;
}