


from __future__ import annotations

from functools import lru_cache
from math import ceil

UpperCAmelCase    =					100

UpperCAmelCase    =					set(range(3, NUM_PRIMES, 2))
primes.add(2)
UpperCAmelCase    =					42

for prime in range(3, ceil(NUM_PRIMES**0.5), 2):
   if prime not in primes:
      continue
   primes.difference_update(set(range(prime * prime, NUM_PRIMES, prime)))






@lru_cache(maxsize=100      )
def  __lowerCAmelCase					(SCREAMING_SNAKE_CASE      )->						set[int]:




      """simple docstring"""

      if number_to_partition < 0:
            return set()
      elif number_to_partition == 0:
            return {1}

      snake_case_ =   set()
      snake_case_ =   42
      snake_case_ =   42

      for prime in primes:
            if prime > number_to_partition:
                  continue
            for sub in partition(number_to_partition - prime      ):
                  ret.add(sub * prime      )

      return ret






def  __lowerCAmelCase					(SCREAMING_SNAKE_CASE = 5000      )->						int | None:




      """simple docstring"""

      for number_to_partition in range(1      ,      SCREAMING_SNAKE_CASE      ):
            if len(partition(SCREAMING_SNAKE_CASE      )      ) > number_unique_partitions:
                  return number_to_partition
      return None


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



def  __lowerCAmelCase					(SCREAMING_SNAKE_CASE      )->						int:




      """simple docstring"""

      assert column_title.isupper()
      snake_case_ =   0
      snake_case_ =   len(SCREAMING_SNAKE_CASE      ) - 1
      snake_case_ =   0

      while index >= 0:
            snake_case_ =   (ord(column_title[index]      ) - 64) * pow(26      ,      SCREAMING_SNAKE_CASE      )
            answer += value
            power += 1
            index -= 1

      return answer


if __name__ == "__main__":
   from doctest import testmod

   testmod()