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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include "stdio.h"
#include "string.h"
#include "stdlib.h"

#define FOUND_THREE 0x01
#define FOUND_FIVE  0x02
#define FOUND_SEVEN 0x04
#define FOUND_ALL   (FOUND_THREE | FOUND_FIVE | FOUND_SEVEN)

int main()
{
	long int input;
	long int i, total=0;
	int j;
	char strCurr[10+1] = "";
	unsigned char sftFlag;

	if (scanf("%ld", &input) == EOF)
	{
		return 0;
	}

	for (i = 0; i < input; i++)
	{
		sftFlag = 0x00;
		sprintf(strCurr, "%ld", i);

		char *curPos = strCurr;
		for (j = 0; j < strlen(strCurr); j++)
		{
			if (*curPos == '7')
			{
				sftFlag |= FOUND_SEVEN;
				curPos++;
			}
			else if (*curPos == '5')
			{
				sftFlag |= FOUND_FIVE;
				curPos++;
			}
			else if(*curPos == '3')
			{
				sftFlag |= FOUND_THREE;
				curPos++;
			}
			else
			{
				break;
			}
		}

		if ((j == strlen(strCurr)) && (sftFlag == FOUND_ALL))
		{
			total++;
		}
	}

	printf("%ld\n", total);

	return 0;
}