N = int(input())
mod = 10**9+7
ans = pow(10, N, mod)
prev_d = 0

while N:
    d = 0
    x = 1
    n = 3
    while pow(2, d+1) <= N:
        n = (n * (pow(10, x, mod) + 1)) % mod
        x = x * 2 % mod
        d += 1

    ans = (ans + n * pow(10, prev_d, mod)) % mod
    N -= 2**d
    prev_d += 2**d

print(ans)