#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for(int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll n;
    cin >> n;
    if(n < 100){
        cout << n/3-3 << endl;
        return 0;
    }
    ll ans = 18;
    int keta = 0;
    ll nn = n;
    while(nn>0){
        keta++;
        nn /= 10;
    }
    /*
    srep(i,3,keta){
        ans += 3 * (1<<((i-1)*2));
    }
    */
    int f[12] = {};
    nn = n;
    rep(i,12){
        f[i] = n % 10;
        n /= 10;
    }
    int flag = 1;
    drep(i,12){
        srep(j,0,4){
            if(j*3<f[i]){
                ans += flag*(1<<(i*2));
            }
        }
        if(f[i]%3!=0)flag = 0;
    }
    ans += flag;
    ans -= 4;
    cout << ans << endl;
    return 0;
}