





from math import isqrt



def        __lowercase       (				_SCREAMING_SNAKE_CASE     )			->       bool:


      '''simple docstring'''


      return all(number % divisor != 0 for divisor in range(2			,						isqrt(_SCREAMING_SNAKE_CASE     ) + 1     )     )



def        __lowercase       (				_SCREAMING_SNAKE_CASE = 10**6     )			->       int:


      '''simple docstring'''


      SCREAMING_SNAKE_CASE		=						0
      SCREAMING_SNAKE_CASE		=						1
      SCREAMING_SNAKE_CASE		=						7
      while prime_candidate < max_prime:
            primes_count += is_prime(_SCREAMING_SNAKE_CASE     )

            cube_index += 1
            prime_candidate += 6 * cube_index

      return primes_count


if __name__ == "__main__":
      print(F'''{solution() = }''')









def        __lowercase       (				_SCREAMING_SNAKE_CASE = 50     )			->       int:


      '''simple docstring'''


      SCREAMING_SNAKE_CASE		=						[1] * (length + 1)

      for row_length in range(3			,						length + 1     ):
            for block_length in range(3			,						row_length + 1     ):
                  for block_start in range(row_length - block_length     ):
                        ways_number[row_length] += ways_number[
                            row_length - block_start - block_length - 1
                        ]

                  ways_number[row_length] += 1

      return ways_number[length]


if __name__ == "__main__":
      print(F'''{solution() = }''')


