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: Time Limit Exceeded)

#include <bits/stdc++.h>
using namespace std; 

bool judge(int x){
  bool f3 = false, f5 = false, f7 =false;
  while(x>0){
    int d = x % 10;
    if(d == 3) f3=true;
    if(d == 5) f5=true;
    if(d == 7) f7=true;
    if(d!=3&&d!=5&&d!=7){
      return false;
    }
    x/=10;
  }
  return f3&&f5&&f7;
  
}





int main() {
  int N;
  cin>>N;
  int count=0;
  for(int i=1;i<=N;i++){
    if(judge(i)){
      count++;
 //     cout <<i<<" "<<count<<endl;
    }
  }
  
  cout <<count<<endl;
  
  
  
}