





def    __lowerCamelCase					(							__a   :int    )		->				bool:






		"""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...''')
					A    :					Any =      int(input('''Enter number: ''').strip())
					print(F'''{number} is {"" if perfect(number) else "not "}a Perfect Number.''')










def    __lowerCamelCase					(							__a   :str    )		->				list:






		"""simple docstring"""

		A__        =   [0] * len(__a    )

		for i in range(1    ,     len(__a    )    ):
				# use last results for better performance - dynamic programming
				A__        =   prefix_result[i - 1]
				while j > 0 and input_string[i] != input_string[j]:
						A__        =   prefix_result[j - 1]

				if input_string[i] == input_string[j]:
						j += 1
				A__        =   j

		return prefix_result







def    __lowerCamelCase					(							__a   :str    )		->				int:






		"""simple docstring"""

		return max(prefix_function(__a    )    )


if __name__ == "__main__":
					import doctest

					doctest.testmod()



