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()
{
	int a, i = 0, j = 0, m = 0, tap = 0, num = 0, t3 = 0, t5 = 0, t7 = 0;
	int ch[100];
	scanf("%d", &a);
	if(a >= 357)
	{
		for(i = 357; i <= a; i++)
		{
			m = 0;
			for(j = i; j > 0;)
			{
				ch[m] = j % 10;
				m++;
				j = j/10;
				
			}
			tap = t3=t5=t7=0;
			for(j = 0; j < m ; j++)
			{
				if(ch[j] == 3 && t3 == 0)
				{
					tap++;
					t3++;
				}
				else if(ch[j] == 5 && t5 == 0)
				{
					tap++;
					t5++;
				}
				else if(ch[j] == 7 && t7 == 0)
				{
					tap++;
					t7++;
				}
			}
			if(tap == 3)
			{
				num++;
				printf("%d\n", i);
			}
		}
	}
	printf("%d\n", num);
	return 0;
}