// dfmt off
T lread(T=long)(){return readln.chomp.to!T;}T[] lreads(T=long)(long n){return iota(n).map!((_)=>lread!T).array;}
T[] aryread(T=long)(){return readln.split.to!(T[]);}void arywrite(T)(T a){a.map!text.join(' ').writeln;}
void scan(L...)(ref L A){auto l=readln.split;foreach(i,T;L){A[i]=l[i].to!T;}}alias sread=()=>readln.chomp();
void dprint(L...)(lazy L A){debug{auto l=new string[](L.length);static foreach(i,a;A)l[i]=a.text;arywrite(l);}}
alias PQueue(T,alias l="b<a")=BinaryHeap!(Array!T,l);import std, core.bitop;
// dfmt on
immutable long MOD = 1000000007;
void main()
{
    auto input = stdin.byLine.map!split.joiner;

    long N;
    N = input.front.to!long;
    input.popFront;

    solve(N);
}

void solve(long N)
{
    if (N == 1)
    {
        writeln(0);
        return;
    }
    auto dp = new long[][](N + 1, 4);
    dp[0][0] = 1;
    foreach (i; 0 .. N)
    {
        dp[i + 1][0] = dp[i][0] * 8;
        dp[i + 1][0] %= MOD;
        dp[i + 1][0b01] = dp[i][0] + dp[i][0b01] * 9;
        dp[i + 1][0b01] %= MOD;
        dp[i + 1][0b10] = dp[i][0] + dp[i][0b10] * 9;
        dp[i + 1][0b10] %= MOD;
        dp[i + 1][0b11] = dp[i][0b01] + dp[i][0b10] + dp[i][0b11] * 10;
        dp[i + 1][0b11] %= MOD;
    }
    writeln(dp[N][0b11]);
}
