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 Ruby (2.3.3) (judge verdict: Accepted)

nu = gets.to_i
nu2 = nu.to_s
le = nu2.length
inst1 = Array.new(le, 0)
ans = []
for i in 0..(4**le) - 1
  inst1[0] += 1
  for j in 0..le - 2
    if inst1[j] == 4
      inst1[j + 1] += 1
      inst1[j] = 1
    else
      break
    end
  end
  if inst1[-1] == 4
    break
  end
  count3 = 0
  count5 = 0
  count7 = 0
  for j in 0..le - 1
    if inst1[j] == 1
      count3 += 1
    elsif inst1[j] == 2
      count5 += 1
    elsif inst1[j] == 3
      count7 += 1
    end
  end
  count = 0
  if count3 >= 1 && count5 >= 1 && count7 >= 1
    for j in 0..le - 1
      if inst1[j] == 1
        count += 3*(10**j)
      elsif inst1[j] == 2
        count += 5*(10**j)
      elsif inst1[j] == 3
        count += 7*(10**j)
      end
    end
    ans.push(count)
  end

end

leng = ans.length
for i in 0..leng - 1
  if ans[i] > nu
    puts i
    exit
  end
end
puts leng