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>
#include<math.h>
int main()
{
    int Num;
    int numBox[9],expo,judge,ans;
    scanf("&d",Num);
    for (;Num>=0;Num--)
    {
        judge=1;
        for(expo=0;expo<9;expo++)
            numBox[expo]=Num/pow(10,expo);
        for(expo=0;expo<9;expo++)
        {
            if(!(numBox[expo]==3||numBox[expo]==5||numBox[expo]==7))
            {
                judge=0;
                break;
            }
        }
    if(judge)
        ans++;
    }
    printf("%d",ans);
    return 0;
}