




from math import sqrt




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						list[int]:

    """simple docstring"""


    __UpperCamelCase			=    [1]
    for i in range(2       ,  int(sqrt(lowercase_   )   ) + 1       ,  1   ):
        if number % i == 0:
            values.append(lowercase_   )
            if int(number // i   ) != i:
                values.append(int(number // i   )   )
    return sorted(lowercase_   )




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						bool:

    """simple docstring"""


    return sum(factors(lowercase_   )   ) > n




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						bool:

    """simple docstring"""


    __UpperCamelCase			=    factors(lowercase_   )
    __UpperCamelCase			=    len(lowercase_   )
    __UpperCamelCase			=    [[0 for i in range(number + 1   )] for j in range(r + 1   )]
    for i in range(r + 1   ):
        __UpperCamelCase			=    True

    for i in range(1       ,  number + 1   ):
        __UpperCamelCase			=    False

    for i in range(1       ,  r + 1   ):
        for j in range(1       ,  number + 1   ):
            if j < values[i - 1]:
                __UpperCamelCase			=    subset[i - 1][j]
            else:
                __UpperCamelCase			=    subset[i - 1][j] or subset[i - 1][j - values[i - 1]]

    return subset[r][number] != 0




def        __SCREAMING_SNAKE_CASE (	lowercase_   )							->						bool:

    """simple docstring"""


    return abundant(lowercase_   ) and not semi_perfect(lowercase_   )


if __name__ == "__main__":
 import doctest

 doctest.testmod(verbose=True)
 for number in (69, 70, 71):
  print(f"""{number} is {'' if weird(number) else 'not '}weird.""")








import math
def lowerCamelCase_       (			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
def lowerCamelCase_       (			A			:      int = 2_00_00_00						):




      """simple docstring"""
      return sum(num for num in range(3		,					A		,					2						) if is_prime(A						)						) + 2 if n > 2 else 0


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



