#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define pi (double) acos(-1.0)
#define P pair<int,int>
#define PiP pair<ll,pair<ll,ll>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;

int main(){
    ll n;
    cin >> n;
    vector<ll> sum(101, 0);
    REP(i, 100){
        sum[i] += sum[i-1];
        if(i % 3 != 0 || i < 10)continue;
        string s = to_string(i);
        if((i/10 + i%10) % 3 == 0)sum[i]++;
    }
    if(n < 100){
        cout << sum[n] << endl;
    }else{
        string s = to_string(n);
        vector<vector<int>> dp(s.size()+1, vector<int>(2, 0));
        dp[0][1] = 1;
        rep(i, s.size()){
            int it = s[i] - '0';
            dp[i+1][0] += dp[i][0] * 4;
            for(int j = 0; j <= it; j+=3){
                if(j == it){
                    dp[i+1][1] += dp[i][1];
                }else{
                    dp[i+1][0] += dp[i][1];
                }
            }
        }
        cout << dp[s.size()][0] + dp[s.size()][1] + 14 << endl;
    }
}