





from math import sqrt


def 			lowerCamelCase_		(					lowerCAmelCase:		int )->						list[int]:
  _snake_case      : Union[str, Any]														=		[1]
  for i in range(2			,							int(sqrt(__UpperCamelCase ) ) + 1			,							1 ):
    if number % i == 0:
      values.append(__UpperCamelCase )
      if int(number // i ) != i:
        values.append(int(number // i ) )
  return sorted(__UpperCamelCase )


def 			lowerCamelCase_		(					lowerCAmelCase:		List[str] )->						bool:
  return sum(factors(__UpperCamelCase ) ) > n


def 			lowerCamelCase_		(					lowerCAmelCase:		int )->						bool:
  _snake_case      : Union[str, Any]														=		factors(__UpperCamelCase )
  _snake_case      : List[Any]														=		len(__UpperCamelCase )
  _snake_case      : Any														=		[[0 for i in range(number + 1 )] for j in range(r + 1 )]
  for i in range(r + 1 ):
    _snake_case      : Optional[Any]														=		True

  for i in range(1			,							number + 1 ):
    _snake_case      : Optional[Any]														=		False

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

  return subset[r][number] != 0


def 			lowerCamelCase_		(					lowerCAmelCase:		List[Any] )->						bool:
  return abundant(__UpperCamelCase ) and not semi_perfect(__UpperCamelCase )


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






"""simple docstring"""


import itertools



def     _lowerCamelCase(__UpperCamelCase       )				-> List[str]:
	return (
	    int("""""".join(combination[0:2]       )       ) * int("""""".join(combination[2:5]       )       )
	    == int("""""".join(combination[5:9]       )       )
	) or (
	    int("""""".join(combination[0]       )       ) * int("""""".join(combination[1:5]       )       )
	    == int("""""".join(combination[5:9]       )       )
	)



def     _lowerCamelCase()				-> Dict:
	return sum(
	    {
	        int("""""".join(pandigital[5:9]       )       )
	        for pandigital in itertools.permutations("""123456789"""       )
	        if is_combination_valid(__UpperCamelCase       )
	    }       )


if __name__ == "__main__":
			print(solution())



