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 (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include<stdio.h>

int check(int n);

int main(void){
  int i,n,kotae=0;
  scanf("%d",&n);
  for(i=1;i<=n;i+=2){
    kotae+=check(i);
  }
  printf("%d",kotae);
  return 0;
}

int check(int n){
  int a=0,b=0,c=0,d=1;
  for(;n>0;n/10){
    switch(n%10){
      case 3:a++;break;
      case 5:b++;break;
      case 7:c++;break;
      default:d=0;break;
    }
  }
  if(a*b*c*d==0){
    return 0;
  }else{
    return 1;
  }
}