





def       UpperCAmelCase							(     _lowerCamelCase      :  int     ):





						'''simple docstring'''


						return sum(i for i in range(1			,   number // 2 + 1     ) if number % i == 0     ) == number


if __name__ == "__main__":
				print("Program to check whether a number is a Perfect number or not...")
				__lowercase       :Optional[int]       =  int(input("Enter number: ").strip())
				print(f"{number} is {'' if perfect(number) else 'not '}a Perfect Number.")






from __future__ import annotations







def       UpperCAmelCase							(     _lowerCamelCase      :  list[int | float]			,   _lowerCamelCase      :  int			,   _lowerCamelCase      :  int     ):





						'''simple docstring'''


						if len(_lowerCamelCase     ) == 0:
												raise ValueError("find_max() arg is an empty sequence"     )
						if (
						    left >= len(_lowerCamelCase     )
						    or left < -len(_lowerCamelCase     )
						    or right >= len(_lowerCamelCase     )
						    or right < -len(_lowerCamelCase     )
						):
												raise IndexError("list index out of range"     )
						if left == right:
												return nums[left]
						SCREAMING_SNAKE_CASE__     :				Optional[int]   =					(left + right) >> 1  # the middle
						SCREAMING_SNAKE_CASE__     :				List[Any]   =					find_max(_lowerCamelCase			,   _lowerCamelCase			,   _lowerCamelCase     )  # find max in range[left, mid]
						SCREAMING_SNAKE_CASE__     :				Optional[int]   =					find_max(_lowerCamelCase			,   mid + 1			,   _lowerCamelCase     )  # find max in range[mid + 1, right]

						return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
				import doctest

				doctest.testmod(verbose=True)