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: #! /usr/bin/env python3
  # -*- coding: utf-8 -*-
  N = int(input())
  ls = [x+1 for x in range(N)]
  candidates = [str(x) for x in ls if "7" in str(x) and "5" in str(x) and "3" in str(x)]
  count = 0
  for _ in range len(candidates):
      candlist = list(candidates)
      ls2 = [x for x in candlist if x != "7" and x != "5"and x != "3"]
      if ls2 is False:
          count += 1
  
  print(count)
  
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"}]