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: Wrong Answer)

#include<stdio.h>
int main(void){
  long long n,temp,cnt=0;
  int thr=0,fiv=0,sev=0;
  scanf("%lld",&n);
  for(long long i=1;i<n+1;i++){
    temp=i;
    while(i>0){
      if(i%10==3||i%10==5||i%10==7){
      }else{
        break;
      }
      i=(long long )i/10;
      if(i==0){
        break;
      }
    }
    if(i==0){
      printf("i=%lld\n",temp);
      i=temp;
      while(i>0){
        switch(i%10){
          case 3:thr++;break;
          case 5:fiv++;break;
          case 7:sev++;break;
        }
        i=(long long )i/10;
        if(i==0){
          break;
        }
      }
      if((thr>0&&fiv>0)&&sev>0){
        cnt++;
      }
      thr=0;fiv=0;sev=0;
    }
    i=temp;
  }
  printf("%lld",cnt);
  return 0;
}