output_description: Print the number of the Shichi-Go-San numbers between 1 and N (inclusive).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: N = input()
  l = int(N[0])
  i = (int(N[0]) - 1) // 2
  if l == 9:
      i = 3
  if i == 0:
      con = 0
  if i == 1:
      con = i * 3 ** (len(N) - 1) - 2 * 2 ** (len(N) - 1) + 2
  if i == 2:
      con = i * 3 ** (len(N) - 1) - 2 * 2 ** (len(N) - 1) - 2 * 1 * 2 ** (len(N) - 1) + 2
  if i == 3:
      con = 3 ** (len(N)) - 3 * 2 ** (len(N)) + 3
  if len(N) != 3:
      for k in range(len(N) - 3):
          con += 3 ** (len(N) - k - 1) - 3 * 2 ** (len(N) - k - 1) + 3
  print(int(con))
  
problem_description: 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.
samples: [{"input": "575", "output": "4\n    \n\nThere are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and\n573.\n\n* * *"}, {"input": "3600", "output": "13\n    \n\nThere are 13 Shichi-Go-San numbers not greater than 3600: the above four\nnumbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.\n\n* * *"}, {"input": "999999999", "output": "26484"}]