#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <iostream>
#include <iomanip>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <numeric>
#include <bitset>

#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define debug(x) cerr << #x << ": " << x << endl

using namespace std;

typedef long long ll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pii;

const ll MOD = 1000000007;
const long double EPS = 1e-10;
const int dyx[4][2] = {
    { 0, 1}, {-1, 0}, {0,-1}, {1, 0}
};

ll modpow(ll a, ll t) {
    ll ret = 1LL;
    while(t) {
        if(t & 1) {
            ret *= a;
            ret %= MOD;
        }
        a *= a;
        a %= MOD;
        t >>= 1;
    }
    return ret;
}

ll solve(ll ei) {
    if(ei <= 8) {
        ll ret = 0LL;
        for(int i=1;i<=ei;++i) {
            ret = ret * 10 + 3;
        }
        return ret;
    }
    ll l = solve(ei/2);
    ll r = solve((ei+1)/2);
    return ((l*modpow(10LL, (ei+1)/2))%MOD+r) % MOD;
}

int main() {
    ll ei;
    cin >> ei;

    if(ei <= 8) {
        cout << '1' + string(ei, '3') + "\n";
    } else {
        cout << (modpow(10LL, ei) + solve(ei))%MOD << "\n";
    }


}