
from math import sqrt

def        lowerCamelCase_      (			UpperCAmelCase_							:				int       ):
						lowercase       :    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_      (			UpperCAmelCase_							:				int       ):
						return sum(factors(UpperCAmelCase_       )       ) > n

def        lowerCamelCase_      (			UpperCAmelCase_							:				int       ):
						lowercase       :    Dict											=  factors(UpperCAmelCase_       )
						lowercase       :    Optional[Any]											=  len(UpperCAmelCase_       )
						lowercase       :    str											=  [[0 for i in range(number + 1       )] for j in range(r + 1       )]
						for i in range(r + 1       ):
												lowercase       :    List[Any]											=  True

						for i in range(1							,			number + 1       ):
												lowercase       :    Union[str, Any]											=  False

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

						return subset[r][number] != 0

def        lowerCamelCase_      (			UpperCAmelCase_							:				int       ):
						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.')




from itertools import combinations_with_replacement

def        lowerCamelCase_      (			UpperCAmelCase_							:				int = 1_00       ):
						lowercase       :    list[int]											=  [*list(range(1							,			21       )       ), 25]
						lowercase       :    list[int]											=  [2 * x for x in range(1							,			21       )] + [50]
						lowercase       :    list[int]											=  [3 * x for x in range(1							,			21       )]
						lowercase       :    list[int]											=  singles + doubles + triples + [0]

						lowercase       :    int											=  0
						lowercase       :    int
						lowercase       :    int
						lowercase       :    int
						lowercase       :    int

						for double in doubles:
												for throwa, throwa in combinations_with_replacement(UpperCAmelCase_							,			2       ):
																		lowercase       :    Union[str, Any]											=  double + throwa + throwa
																		if checkout_total < limit:
																								num_checkouts += 1

						return num_checkouts


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


