



'''simple docstring'''





from __future__ import annotations

import math




def lowerCAmelCase						(__A):



     """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


lowercase_	 =						[num for num in range(3, 100_001, 2) if not is_prime(num)]




def lowerCAmelCase						(__A):



     """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 lowerCAmelCase						():



     """simple docstring"""



     return compute_nums(1)[0]


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








'''simple docstring'''





from __future__ import annotations

import math




def lowerCAmelCase						(__A						,			__A						,			__A						,			__A						,			__A):



     """simple docstring"""



     if depth < 0:
          raise ValueError('''Depth cannot be less than 0''')

     if not scores:
          raise ValueError('''Scores cannot be empty''')

     if depth == height:
          return scores[node_index]

     return (
         max(
             minimax(depth + 1						,			node_index * 2						,			__A						,			__A						,			__A)						,			minimax(depth + 1						,			node_index * 2 + 1						,			__A						,			__A						,			__A)						,			)
         if is_max
         else min(
             minimax(depth + 1						,			node_index * 2						,			__A						,			__A						,			__A)						,			minimax(depth + 1						,			node_index * 2 + 1						,			__A						,			__A						,			__A)						,			)
     )




def lowerCAmelCase						():



     """simple docstring"""



     _a											=						[90, 23, 6, 33, 21, 65, 123, 34_423]
     _a											=						math.log(len(__A)						,			2)
     print(F'''Optimal value : {minimax(0						,			0						,			__A						,			__A						,			__A)}''')


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  main()



