#include <bits/stdc++.h>
using namespace std;
typedef long long lint;

const lint MOD = (lint)1e9 + 7;
lint pre[65];

lint mod_pow(lint n, lint x){
    lint res = 1;
    while(x){
        if(x & 1) res = res * n % MOD;
        x >>= 1; n = n * n % MOD;
    }
    return res;
}

int main(){
    lint N; cin >> N;

    pre[0] = 3;
    for(int i=1;(1LL<<i)<=N;i++){
        pre[i] = pre[i-1] * mod_pow(10, 1LL<<(i-1)) + pre[i-1];
        pre[i] %= MOD;
    }

    lint ans = mod_pow(10, N), cur = 0;
    for(int i=0;0<N;i++){
        if(N & 1){
            ans += pre[i] * mod_pow(10, cur);
            ans %= MOD; cur += (1LL<<i);
        }
        N >>= 1;
    }

    cout << ans << endl;
    return 0;
}