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 Rust (1.42.0) (judge verdict: Accepted)

use proconio::input;

fn main() {
  input! {
    n: usize,
  }

  let mut count = 0;
  let mut i = 0;
  let mut v = 357;
  while v <= n {
    let mut temp = v;
    let mut f3 = false;
    let mut f5 = false;
    let mut f7 = false;
    while 0 < temp {
      let vv = temp % 10;
      if vv == 7 {
        f7 = true;
      } else if vv == 5 {
        f5 = true;
      } else if vv == 3 {
        f3 = true;
      } else {
        f3 = false;
        break
      }
      temp /= 10;
    }
    if f3 && f5 && f7 {
      count += 1;
    }
    
    if i % 3 == 0 {
      v += 6;
    } else {
      v += 2;
    }
    i += 1;
  }
  println!("{}", count);
}