




from __future__ import annotations

import math




def     __magic_name__       (				A	:      int     ):






   '''simple docstring'''







   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(math.sqrt(A     ) + 1     ),						6     ):
      if number % i == 0 or number % (i + 2) == 0:
         return False
   return True


__lowerCAmelCase	:       Any     =	[num for num in range(3, 10_0001, 2) if not is_prime(num)]




def     __magic_name__       (				A	:      int     ):






   '''simple docstring'''







   if not isinstance(A,						A     ):
      raise ValueError("n must be an integer"     )
   if n <= 0:
      raise ValueError("n must be >= 0"     )

   a					=    []
   for num in range(len(A     )     ):
      a					=    0
      while 2 * i * i <= odd_composites[num]:
         a					=    odd_composites[num] - 2 * i * i
         if is_prime(A     ):
            break
         i += 1
      else:
         list_nums.append(odd_composites[num]     )
         if len(A     ) == n:
            return list_nums

   return []




def     __magic_name__       (				):






   '''simple docstring'''







   return compute_nums(1     )[0]


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












def     __magic_name__       (				A	:      int,						A	:      int,						A	:      int     ):






			'''simple docstring'''







			if exponent == 1:
						return base
			if exponent % 2 == 0:
						a					=    _modexpt(A,						exponent // 2,						A     ) % modulo_value
						return (x * x) % modulo_value
			else:
						return (base * _modexpt(A,						exponent - 1,						A     )) % modulo_value




def     __magic_name__       (				A	:      int = 1777,						A	:      int = 1855,						A	:      int = 8     ):






			'''simple docstring'''







			a					=    base
			for _ in range(1,						A     ):
						a					=    _modexpt(A,						A,						10**digits     )

			return result


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






