Problem:
Score : 300 points

Problem Statement

You are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally "Seven-Five-Three numbers") are there?

Here, a Shichi-Go-San number is a positive integer that satisfies the following condition:

When the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.

Constraints

1 \leq N < 10^9

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of the Shichi-Go-San numbers between 1 and N (inclusive).

Sample Input 1

575

Sample Output 1

4

There are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.

Sample Input 2

3600

Sample Output 2

13

There are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.

Sample Input 3

999999999

Sample Output 3

26484

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>
#include<string>
#include<vector>
#include<iomanip>
#include<map>
#include<list>
#include<queue>
using namespace std;
#define ll long long

int judge753(ll a){
  int flag3,flag5,flag7;
  int tmp;
  flag3=0;
  flag5=0;
  flag7=0;
  while(a>0){
    tmp=a%10;
    if(tmp==3)flag3=1;
    if(tmp==5)flag5=1;
    if(tmp==7)flag7=1;
    a=a/10;
  }
  if(flag3*flag5*flag7==1){
    return 1;
  }else{
    return 0;
  }
}

int main(){
  ll N;
  cin >> N;
  queue<ll> q;
  q.push(3);
  q.push(5);
  q.push(7);
  ll cnt,a;
  int flag3,flag5,flag7;
  while(!q.empty()){
     a=q.front();
     if(a*10+3<=N)q.push(a*10+3);
     if(a*10+5<=N)q.push(a*10+5);
     if(a*10+7<=N)q.push(a*10+7);
     cnt+=judge753(a);
     q.pop();
  }
    cout << 4 <<endl;
    return 0;
}