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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)


import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {

	static boolean[] res = new boolean[3];
	static String[] num;
//	static int c = 0;
	
	public static void main(String[] args) throws Exception{
		try(BufferedReader br = new BufferedReader(new InputStreamReader(System.in))){
			int n = Integer.parseInt(br.readLine());
			int result = 0;
			boolean coun = false;
			int count = 0;
			if(n >= 357) {
				for(int i=n; i>=357; i--) {
					if(coun) {
						count++;
						if(count > 18) {
							count = 0;
							coun = false;
						}else {
							continue;
						}
					}
					num = String.valueOf(i).split("");
					res[0] = false;
					res[1] = false;
					res[2] = false;
					for(int j=0; j<num.length; j++) {
//						c ++;
						int r = Integer.parseInt(num[j]);
						if(r == 3) res[0] = true;
						else if(r == 5) res[1] = true;
						else if(r == 7) res[2] = true;
						else {
							res[0] = false;
							break;
						}
					}
					if(res[0] && res[1] && res[2]) {
						result++;
						coun = true;
						count = 1;
					}
				}
			}
			System.out.println(result);
//			System.out.println(c);
		}

	}

}