




from math import sqrt




def      __magic_name__							(					A						:   int  ):






			'''simple docstring'''







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




def      __magic_name__							(					A						:   int  ):






			'''simple docstring'''







			return sum(factors(A  )  ) > n




def      __magic_name__							(					A						:   int  ):






			'''simple docstring'''







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

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

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

			return subset[r][number] != 0




def      __magic_name__							(					A						:   int  ):






			'''simple docstring'''







			return abundant(A  ) and not semi_perfect(A  )


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












class        snake_case__				:
				"""simple docstring"""



				def __init__( self							:	List[str]   , __lowerCamelCase							:	int				)   ->	None:
							a       =     data
							a       =     42
							a       =     42




def      __magic_name__							(					A						:   Node  ):






			'''simple docstring'''







			a       =     0
			a       =     x




def      __magic_name__							(					A						:   Node,    A						:   Node  ):






			'''simple docstring'''







			a       ,						a       =     find_set(A  ), find_set(A  )
			if x == y:
						return

			elif x.rank > y.rank:
						a       =     x
			else:
						a       =     y
						if x.rank == y.rank:
									y.rank += 1




def      __magic_name__							(					A						:   Node  ):






			'''simple docstring'''







			if x != x.parent:
						a       =     find_set(x.parent  )
			return x.parent




def      __magic_name__							(					A						:   Node  ):






			'''simple docstring'''







			a       =     ({0, 1, 2}, {3, 4, 5})
			for s in sets:
						if node.data in s:
									return s
			a       =     F"""{node.data} is not in {sets}"""
			raise ValueError(A  )




def      __magic_name__							(					):






			'''simple docstring'''







			a       =     [Node(A  ) for i in range(6  )]
			for v in vertex:
						make_set(A  )

			union_set(vertex[0],    vertex[1]  )
			union_set(vertex[1],    vertex[2]  )
			union_set(vertex[3],    vertex[4]  )
			union_set(vertex[3],    vertex[5]  )

			for nodea in vertex:
						for nodea in vertex:
									if find_python_set(A  ).isdisjoint(find_python_set(A  )  ):
												assert find_set(A  ) != find_set(A  )
									else:
												assert find_set(A  ) == find_set(A  )


if __name__ == "__main__":
		test_disjoint_set()






