






'''simple docstring'''


from math import sqrt






def   lowerCAmelCase__			(					SCREAMING_SNAKE_CASE__		):
 __a    :	Union[str, Any]									=						[1]
 for i in range(2       ,		int(sqrt(SCREAMING_SNAKE_CASE__		)		) + 1       ,		1		):
  if number % i == 0:
   values.append(SCREAMING_SNAKE_CASE__		)
   if int(number // i		) != i:
    values.append(int(number // i		)		)
 return sorted(SCREAMING_SNAKE_CASE__		)






def   lowerCAmelCase__			(					SCREAMING_SNAKE_CASE__		):
 return sum(factors(SCREAMING_SNAKE_CASE__		)		) > n






def   lowerCAmelCase__			(					SCREAMING_SNAKE_CASE__		):
 __a    :	Dict									=						factors(SCREAMING_SNAKE_CASE__		)
 __a    :	List[str]									=						len(SCREAMING_SNAKE_CASE__		)
 __a    :	Tuple									=						[[0 for i in range(number + 1		)] for j in range(r + 1		)]
 for i in range(r + 1		):
  __a    :	str									=						True

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

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

 return subset[r][number] != 0






def   lowerCAmelCase__			(					SCREAMING_SNAKE_CASE__		):
 return abundant(SCREAMING_SNAKE_CASE__		) and not semi_perfect(SCREAMING_SNAKE_CASE__		)


if __name__ == "__main__":
  import doctest

  doctest.testmod(verbose=True)
  for number in (6_9, 7_0, 7_1):
    print(F"{number} is {'' if weird(number) else 'not '}weird.")












'''simple docstring'''


def   lowerCAmelCase__			(					SCREAMING_SNAKE_CASE__ = 30		):
 __a    :	Tuple									=						exponent + 2
 __a    :	str									=						(1 + 5**0.5) / 2
 __a    :	Any									=						(phi**fibonacci_index - (phi - 1) ** fibonacci_index) / 5**0.5

 return int(SCREAMING_SNAKE_CASE__		)


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




