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 <stdlib.h>
#include <string.h>
 
static int tenpower[10];
 
int calc(int n, int c, int t, int lz) {
	int i[3] = {};
	if (c == 0) {
		while (t > 0) {
			if (t % 10 == 3) i[0] = 1;
			if (t % 10 == 5) i[1] = 1;
			if (t % 10 == 7) i[2] = 1;
			t /= 10;
		}
		if (i[0] + i[1] + i[2] == 3) {
			return 1;
		}
		return 0;
        }
	int r = 0;
	if (lz) r = calc(n, c - 1, t, 1);
	if (n > t + 3 * tenpower[c - 1]) {
		r += calc(n, c - 1, t + 3 * tenpower[c - 1], 0);
	}
	if (n > t + 5 * tenpower[c - 1]) {
		r += calc(n, c - 1, t + 5 * tenpower[c - 1], 0);
	}
	if (n > t + 7 * tenpower[c - 1]) {
		r += calc(n, c - 1, t + 7 * tenpower[c - 1], 0);
	}
	return r;
}
 
int main(int argc, char *argv[]) {
	int n;
	scanf("%d", &n);
	int r, c;
	if (n < 357) {
      printf("0\n");
      return 0;
    }
	for (r = n, c = 0; r > 0; c++) r /= 10;
	tenpower[0] = 1;
	for (r = 1; r < 10; r++) tenpower[r] = 10 * tenpower[r - 1];
	printf("%d\n", calc(n, c, 0, 1));
	return 0;
}