#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

template <typename T>
istream &operator>>(istream &is, vector<T> &v)
{
    for (T &in : v)
        is >> in;
    return is;
}

int main(void)
{
    // int n;
    // cin >> n;
    vector<int> a(100);
    int p;
    cin >> p;
    a[p] = 1;
    // rep(i, 100)
    // {
    //     a[i] = n % 10;
    //     n /= 10;
    // }
    reverse(all(a));
    auto print_vector = [](auto v)
    {
        int size = v.size();
        rep(i, size)
        {
            if (i < size - 1)
            {
                cout << v[i] << ' ';
            }
            else
            {
                cout << v[i] << endl;
            }
        }
    };
    // print_vector(a);
    ll dp[101][3][2][2] = {};
    dp[0][0][0][0] = 1;
    rep(i, 100)
    {
        rep(mod3, 3)
        {
            rep(have3, 2)
            {
                rep(small, 2)
                {
                    rep(j, 10)
                    {
                        dp[i + 1][(j + mod3) % 3][have3 | (j == 3)][small | j < a[i]] += dp[i][mod3][have3][small] * (small | (j <= a[i]));
                    }
                }
            }
        }
    }
    ll ans = 0;
    rep(mod3, 3)
    {
        rep(have3, 2)
        {
            rep(smaller, 2)
            {
                if (mod3 > 0 && !have3)
                {
                    continue;
                }
                ans += dp[100][mod3][have3][smaller];
            }
        }
    }
    cout << ans - 1 << endl;
}