code: 
  
  
  
  
  
  '''simple docstring'''
  
  
  from math import sqrt
  
  
  
  
  def    __a (     UpperCAmelCase    )      ->str:
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	A							  =      [1]
  	for i in range(2       ,			int(sqrt(lowercase__    )    ) + 1       ,			1    ):
  		if number % i == 0:
  			values.append(lowercase__    )
  			if int(number // i    ) != i:
  				values.append(int(number // i    )    )
  	return sorted(lowercase__    )
  
  
  
  
  def    __a (     UpperCAmelCase    )      ->Tuple:
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	return sum(factors(lowercase__    )    ) > n
  
  
  
  
  def    __a (     UpperCAmelCase    )      ->List[str]:
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	A							  =      factors(lowercase__    )
  	A							  =      len(lowercase__    )
  	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    __a (     UpperCAmelCase    )      ->Any:
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	return abundant(lowercase__    ) and not semi_perfect(lowercase__    )
  
  
  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.")
  
  
  
  
  
  
  
style_context: 
  
  
  
  
  
  '''simple docstring'''
  
  
  _lowerCamelCase				:	List[str]				    =       [[0, 1, 1], [0, 0, 1], [1, 0, 0]]
  
  
  
  class 							__UpperCAmelCase  :
  
  
  
  
  
  
  
  		'''simple docstring'''
  
  
  
  
  
  
  
  		def __init__(self						:      List[Any]      ,      _lowerCAmelCase						:      List[Any]      ):
  			A							  =      name
  			A							  =      []
  			A							  =      []
  
  
  
  
  
  
  
  		def        A     (self						:      Dict      ,      _lowerCAmelCase						:      str      ):
  			self.inbound.append(_lowerCAmelCase      )
  
  
  
  
  
  
  
  		def        A     (self						:      Dict      ,      _lowerCAmelCase						:      Any      ):
  			self.outbound.append(_lowerCAmelCase      )
  
  
  
  
  
  
  
  		def __repr__(self						:      Tuple      ):
  			return F"""<node={self.name} inbound={self.inbound} outbound={self.outbound}>"""
  
  
  
  
  
  
  def    __a (     UpperCAmelCase       ,			UpperCAmelCase=3       ,			UpperCAmelCase=0.85    )      ->Tuple:
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	A							  =      {}
  	for node in nodes:
  		A							  =      1
  
  	A							  =      {}
  	for node in nodes:
  		A							  =      len(node.outbound    )
  
  	for i in range(UpperCAmelCase    ):
  		print(f"""======= Iteration {i + 1} ======="""    )
  		for _, node in enumerate(UpperCAmelCase    ):
  			A							  =      (1 - d) + d * sum(
  			    ranks[ib] / outbounds[ib] for ib in node.inbound    )
  		print(UpperCAmelCase    )
  
  
  
  
  def    __a (     )      ->Any:
  
  
  
  	"""simple docstring"""
  
  
  
  
  
  
  
  	A							  =      list(input("""Enter Names of the Nodes: """    ).split()    )
  
  	A							  =      [Node(UpperCAmelCase    ) for name in names]
  
  	for ri, row in enumerate(UpperCAmelCase    ):
  		for ci, col in enumerate(UpperCAmelCase    ):
  			if col == 1:
  				nodes[ci].add_inbound(names[ri]    )
  				nodes[ri].add_outbound(names[ci]    )
  
  	print("""======= Nodes ======="""    )
  	for node in nodes:
  		print(UpperCAmelCase    )
  
  	page_rank(UpperCAmelCase    )
  
  
  if __name__ == "__main__":
  				main()
  
  