#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;

#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF=1e16+18;
const ll MAX=100005;
const ll MOD=1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) cerr << #mp << ":"<<endl; for (auto i = mp.begin(); i != mp.end(); ++i) { cerr << i->first <<":"<<i->second << endl;}
#define dbgarr(n,m,arr) rep(i,n){rep(j,m){cerr<<arr[i][j]<<" ";}cerr<<endl;}
#define dbgdp(n,arr) rep(i,n){cerr<<arr[i]<<" ";}cerr<<endl;
#define sum(v) accumulate(ALL(v),0)
#define fi first
#define se second

template<typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }

// vector
template<typename T>
ostream &operator<<(ostream &s, const vector<T> &v) {
    int len=v.size();
    for(int i=0; i<len; ++i) {
        s<<v[i];
        if(i<len-1) s<<"	";
    }
    return s;
}

// 2 dimentional vector
template<typename T>
ostream &operator<<(ostream &s, const vector<vector<T> > &vv) {
    int len=vv.size();
    for(int i=0; i<len; ++i) {
        s<<vv[i]<<endl;
    }
    return s;
}

int dp[11][2][2][8];
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(10);

    ll n;
    cin>>n;
    string s = to_string(n);
    ll len = s.size();//keta

    dp[0][0][0][0]=1;
    // i上位i桁まで j数字を自由に選べるか k数字を書き込んだか l {3,5,7}のフラグ

    rep(i,len){
        rep(j,2){
            rep(k,2){
                rep(l,8){
                    if(!dp[i][j][k][l])continue;
                    if(j==1){
                        if(k==0){
                            dp[i+1][1][0][0] += dp[i][j][k][l];
                        }
                        dp[i+1][1][1][l|1] += dp[i][j][k][l];//3
                        dp[i+1][1][1][l|2] += dp[i][j][k][l];//5
                        dp[i+1][1][1][l|4] += dp[i][j][k][l];//7
                    }else{
                        ll d = s[i]-'0';
                        if(k==0){
                            dp[i+1][1][0][0] += dp[i][j][k][l];
                        }
                        if(d==3){
                            dp[i+1][0][1][l|1] += dp[i][j][k][l];
                        }
                        if(3<d){
                            dp[i+1][1][1][l|1] += dp[i][j][k][l];
                        }
                        if(d==5){
                            dp[i+1][0][1][l|2] += dp[i][j][k][l];
                        }
                        if(5<d){
                            dp[i+1][1][1][l|2] += dp[i][j][k][l];
                        }
                        if(d==7){
                            dp[i+1][0][1][l|4] += dp[i][j][k][l];
                        }
                        if(7<d){
                            dp[i+1][1][1][l|4] += dp[i][j][k][l];
                        }

                    }
                }
            }
        }
    }
    int ans = dp[len][0][1][7]+dp[len][1][1][7];
    cout<<ans<<endl;
    return  0;
}


Measured memory_bytes: 256