





from math import sqrt




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE	)       ->     bool:

  if 1 < number < 4:
    # 2 and 3 are primes
    return True
  elif number < 2 or number % 2 == 0 or number % 3 == 0:
    # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
    return False

  # All primes number are in format of 6k +/- 1
  for i in range(5	,		int(sqrt(_SCREAMING_SNAKE_CASE	) + 1	)	,		6	):
    if number % i == 0 or number % (i + 2) == 0:
      return False
  return True




def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE = 10001	)       ->     int:
  lowercase__			    =						0
  lowercase__			    =						1
  while count != nth and number < 3:
    number += 1
    if is_prime(_SCREAMING_SNAKE_CASE	):
      count += 1
  while count != nth:
    number += 2
    if is_prime(_SCREAMING_SNAKE_CASE	):
      count += 1
  return number


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









def     __UpperCamelCase						(_SCREAMING_SNAKE_CASE = 50	)       ->     int:
  lowercase__			    =						[[0] * 3 for _ in range(length + 1	)]

  for row_length in range(length + 1	):
    for tile_length in range(2	,		5	):
      for tile_start in range(row_length - tile_length + 1	):
        different_colour_ways_number[row_length][tile_length - 2] += (
            different_colour_ways_number[row_length - tile_start - tile_length][
                tile_length - 2
            ]
            + 1
        )

  return sum(different_colour_ways_number[length]	)


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


