#include <iostream>
#include <vector>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <cmath>
#include <cstring>

using namespace std;

#define FOR(x,y) for(int x = 0;x < (y);x++)
#define LLI long long int
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())

#define _L(x) cout<<(x)<<endl
//#define _L(x) ;

template<int um> class UF {
public:
    vector<int> _parent,_rank;
    UF()
    {
        _parent=_rank=vector<int>(um,0);
        for(int i=0;i<um;i++)
        {
            _parent[i]=i;
        }
    }
    
    int Find(int x)
    {
        if(_parent[x] == x)
        {
            return x;
        }
        _parent[x] = Find(_parent[x]);
        return _parent[x];
    }
    
    int Union(int x,int y)
    {
        int xRoot = Find(x);
        int yRoot = Find(y);
        if(_rank[xRoot]>_rank[yRoot])
        {
            _parent[xRoot] = yRoot;
           return yRoot;
        }
        if(_rank[xRoot]<_rank[yRoot])
        {
            _parent[yRoot] = xRoot;
            return xRoot;
        }
        if(xRoot != yRoot)
        {
            _parent[yRoot] = xRoot;
            _rank[xRoot]++;
            return xRoot;
        }
        return xRoot;
    }
};


LLI dp[21][2][2][3];

int main() {
    int digits;
    cin >> digits;
    digits++;
    
    memset(&dp[0][0][0][0], 0, sizeof(dp));
    
    dp[0][0][0][0] = 1;
    FOR(i, digits) FOR(j, 2) FOR(m, 2) FOR(l, 3)
    {
        if(j)
        {
            FOR (d, 10)
            {
                dp[i + 1][1][m || d == 3][(l + d) % 3] += dp[i][1][m][l];
            }
        }
        else
        {
            int u = i == 0 ? 1 : 0;
            FOR (d, u + 1)
            {
                dp[i + 1][d < u][m || d == 3][(l + d) % 3] += dp[i][0][m][l];
                //if(m == 0 && l == 0)
                //{
                //    LLI current = dp[i][0][m][l];
                //    LLI next = dp[i + 1][d < u][m || d == 3][(l + d) % 3];
                //    cout << i+1 << "," << (d < u) << "," << (m || d == 3) << "," << ((l + d) % 3) << endl;
                //    cout << current << "," << next << endl;
                //}
            }
        }
    }
    
    //FOR(i,3) FOR(j, 2) FOR(k, 2) FOR(l, 3)
    //{
    //    cout << i << "," << j << "," << k << "," << l << ":" << dp[i][j][k][l] << endl;
    //}

    LLI sum = 0;
    FOR(j, 2) FOR(k, 2) FOR(l, 3)
    {
        if(k != 0 || l == 0)
        {
            sum += dp[digits][j][k][l];
        }
    }
    sum--;
    cout << sum << endl;
    return 0;
}