code: 
  
  
  
  
  
  '''simple docstring'''
  
  
  
  
  
  
  
  from math import sqrt
  
  
  
  
  
  def      _lowerCAmelCase		(		lowercase			)      ->      list[int]:
  			__lowerCAmelCase      		=       [1]
  			for i in range(2      ,			int(sqrt(lowerCamelCase__			)			) + 1      ,			1			):
  						if number % i == 0:
  									values.append(lowerCamelCase__			)
  									if int(number // i			) != i:
  												values.append(int(number // i			)			)
  			return sorted(lowerCamelCase__			)
  
  
  
  
  
  def      _lowerCAmelCase		(		lowercase			)      ->      bool:
  			return sum(factors(lowerCamelCase__			)			) > n
  
  
  
  
  
  def      _lowerCAmelCase		(		lowercase			)      ->      bool:
  			__lowerCAmelCase      		=       factors(lowerCamelCase__			)
  			__lowerCAmelCase      		=       len(lowerCamelCase__			)
  			__lowerCAmelCase      		=       [[0 for i in range(number + 1			)] for j in range(r + 1			)]
  			for i in range(r + 1			):
  						__lowerCAmelCase      		=       True
  
  			for i in range(1      ,			number + 1			):
  						__lowerCAmelCase      		=       False
  
  			for i in range(1      ,			r + 1			):
  						for j in range(1      ,			number + 1			):
  									if j < values[i - 1]:
  												__lowerCAmelCase      		=       subset[i - 1][j]
  									else:
  												__lowerCAmelCase      		=       subset[i - 1][j] or subset[i - 1][j - values[i - 1]]
  
  			return subset[r][number] != 0
  
  
  
  
  
  def      _lowerCAmelCase		(		lowercase			)      ->      bool:
  			return abundant(lowerCamelCase__			) and not semi_perfect(lowerCamelCase__			)
  
  
  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.')
  
  
  
style_context: 
  
  
  
  
  
  '''simple docstring'''
  
  
  
  
  
  
  
  def      _lowerCAmelCase		(		lowercase = 1000			)      ->      int:
  			__lowerCAmelCase      		=       []
  			__lowerCAmelCase      		=       []
  			__lowerCAmelCase      		=       3
  			__lowerCAmelCase      		=       5
  			__lowerCAmelCase      		=       1
  			while True:
  						__lowerCAmelCase      		=       z * temp
  						if result < n:
  									zmulti.append(lowercase			)
  									temp += 1
  						else:
  									__lowerCAmelCase      		=       1
  									break
  			while True:
  						__lowerCAmelCase      		=       x * temp
  						if result < n:
  									xmulti.append(lowercase			)
  									temp += 1
  						else:
  									break
  			__lowerCAmelCase      		=       list(set(xmulti + zmulti			)			)
  			return sum(lowercase			)
  
  
  if __name__ == "__main__":
  	print(f'{solution() = }')
  
  