#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

template <class T, class U>
vector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }

template<class... Ts, class U>
auto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }

template<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }
template<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }

int main() {
    int n;
    cin >> n;
    string s = "1";
    for (int i = 0; i < n; ++i) {
        s += "0";
    }
    auto dp = make_v(s.size()+1, 2, 3, 2, 0LL);
    dp[0][0][0][0] = 1;
    for (int i = 0; i < s.size(); ++i) {
        for (int j = 0; j < 2; ++j) {
            int d = j ? 9 : s[i]-'0';
            for (int x = 0; x <= d; ++x) {
                for (int k = 0; k < 3; ++k) {
                    for (int l = 0; l < 2; ++l) {
                        dp[i+1][j | (x < d)][(k+x)%3][l | (x == 3)] += dp[i][j][k][l];
                    }
                }
            }
        }
    }
    ll ans = 0;
    for (int j = 0; j < 2; ++j) {
        for (int k = 0; k < 3; ++k) {
            for (int l = 0; l < 2; ++l) {
                if(k == 0 || l == 1) ans += dp.back()[j][k][l];
            }
        }
    }
    cout << ans-1 << "\n";
    return 0;
}