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

#include<iostream>
using namespace std;
int main()
{
	long long T;
	cin>>T;
	int n=0;
	for(int i=357;i<=T;i++)
	{
		int j=i;
		int k=1,x=0,y=0,z=0;
		while(j)
		{
			int a=j%10;
			if(a!=3&&a!=5&&a!=7)
			{
				k=0;
				break;
			}
			if(a==3)
			x=1;
			else if(a==5)
			y=1;
			else if(a==7)
			z=1;
			j=j/10;
		}
		if(k&&x&&y&&z)
		{
			//cout<<i<<endl;
			n++;
		}
		
	}
	cout<<n<<endl;
	return 0;
}