#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using mint = modint1000000007;
using C = complex<double>;
const int mod = 998244353;
const long long LINF = 1001002003004005006;
const int INF = 1001001001;
const double PI = acos(-1);
const double EPS = 1e-10;
const int di[4] = {-1,0,1,0};
const int dj[4] = {0,-1,0,1};
const int dx[8] = {1,1,1,0,0,-1,-1,-1};
const int dy[8] = {1,0,-1,1,-1,1,0,-1};
# define sz(x) (int)(x).size()
# define rsz(x,n) x.resize(n)
# define yosupo(x) {cout << (x) << endl; return 0;}
# define ll long long
# define fi first
# define se second
# define pb push_back
# define pf push_front
# define eb emplace_back
# define ef emplace_front
# define pob pop_back
# define pof pop_front
# define GET_MACRO(_1, _2, _3, NAME, ...) NAME
# define _rep(i, n) _rep2(i, 0, n)
# define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
# define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
# define srep(i, a, b) for(int i = a; i <= b; ++i)
# define all(obj) (obj).begin(), (obj).end()
# define rall(obj) (obj).rbegin(), (obj).rend()
inline void YesNo(bool f) { std::cout << (f? "Yes": "No") << std::endl; }
void read() {}
template <typename T, class... U> void read(T &t, U &...u) { cin >> t; read(u...); }
void writeln() { cout << endl; }
template <typename T, class... U, char sep = ' '> void writeln(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; writeln(u...); }
# define Pll pair<ll, ll>
# define P pair<int,int>
# define bit(x,i) (((x) >> (i)) & 1)
# define equals(a, b) (fabs((a) - (b)) < EPS) // 誤差を考慮した同値判定
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}
template <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << "P(" << p.first << " " << p.second << ")";}
template<typename T> using vc = vector<T>;
template<typename T> using vv = vc<vc<T>>;
using vi = vc<int>; using vvi = vv<int>;
using vl = vc<ll>; using vvl = vv<ll>;
using vm = vc<mint>; using vvm = vv<mint>;

//桁数, 桁和のmod3, 3があるか, 以下フラグ
ll dp[20][3][2][2];

int main() {
    int p;
    read(p);
    string s = "1";
    rep(i,p) s += "0";
    int n = sz(s);
    dp[0][0][0][0] = 1;
    rep(i,n) {
        int nd = s[i]-'0';
        rep(j,3) {
            rep(t,2) {
                if(t == 0) {
                    int nj = (j+nd)%3;
                    if(nd == 3) {
                        dp[i+1][nj][1][0] += dp[i][j][0][0];
                        dp[i+1][nj][1][0] += dp[i][j][1][0];
                    }
                    else {
                        dp[i+1][nj][0][0] += dp[i][j][0][0];
                        dp[i+1][nj][1][0] += dp[i][j][1][0];
                    }
                } else {
                    rep(k,nd) {
                        if(k == 3) {
                            int nj = (j+k)%3;
                            dp[i+1][nj][1][1] += dp[i][j][0][0];
                            dp[i+1][nj][1][1] += dp[i][j][1][0];
                        } else {
                            int nj = (j+k)%3;
                            dp[i+1][nj][0][1] += dp[i][j][0][0];
                            dp[i+1][nj][1][1] += dp[i][j][1][0];
                        }
                    }
                    rep(k,10) {
                        if(k == 3) {
                            int nj = (j+k)%3;
                            dp[i+1][nj][1][1] += dp[i][j][0][1];
                            dp[i+1][nj][1][1] += dp[i][j][1][1];
                        } else {
                            int nj = (j+k)%3;
                            dp[i+1][nj][0][1] += dp[i][j][0][1];
                            dp[i+1][nj][1][1] += dp[i][j][1][1];
                        }
                    }
                }
            }
        }
    }
    ll ans = 0;
    rep(i,3) rep(j,2) rep(k,2) {
        if(i == 0 || j == 1) ans += dp[n][i][j][k];
    }
    writeln(ans-1);
}