






'''simple docstring'''



from __future__ import annotations

from functools import lru_cache
from math import ceil

SCREAMING_SNAKE_CASE						=	100

SCREAMING_SNAKE_CASE						=	set(range(3, NUM_PRIMES, 2))
primes.add(2)
SCREAMING_SNAKE_CASE						=	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=1_0_0			)
def 							lowercase_				(    __A :       int			)       ->      set[int]:



 """simple docstring"""




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

 lowercase					:   set[int]				  =set()
 lowercase					:   int
 lowercase					:   int

 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 							lowercase_				(    __A :       int = 5_0_0_0			)       ->      int | None:



 """simple docstring"""




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


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











'''simple docstring'''



import re


def 							lowercase_				(    __A :       str			)       ->      bool:



 """simple docstring"""




 lowercase					:   Any				  =re.compile(R'''^(\+91[\-\s]?)?[0]?(91)?[789]\d{9}$'''			)
 if match := re.search(__A					,      __A			):
  return match.string == phone
 return False


if __name__ == "__main__":
      print(indian_phone_validator('+918827897895'))



