

from collections import Counter
from timeit import timeit


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__ = ""  ,		):
						return sum(c % 2 for c in Counter(input_str.replace(''' '''  ,		''''''       ).lower()       ).values()       ) < 2


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__ = ""       ):
						if len(SCREAMING_SNAKE_CASE__       ) == 0:
												return True
						snake_case_   =	input_str.replace(''' '''  ,		''''''       ).lower()
						# character_freq_dict: Stores the frequency of every character in the input string
						snake_case_   =	{}

						for character in lower_case_input_str:
												snake_case_   =	character_freq_dict.get(SCREAMING_SNAKE_CASE__  ,		0       ) + 1
						snake_case_   =	0

						for character_count in character_freq_dict.values():
												if character_count % 2:
																		odd_char += 1
						if odd_char > 1:
												return False
						return True


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__ = ""       ):
						print('''\nFor string = '''  ,		SCREAMING_SNAKE_CASE__  ,		''':'''       )
						print(
						    '''> can_string_be_rearranged_as_palindrome_counter()'''  ,		'''\tans ='''  ,		can_string_be_rearranged_as_palindrome_counter(SCREAMING_SNAKE_CASE__       )  ,		'''\ttime ='''  ,		timeit(
						        '''z.can_string_be_rearranged_as_palindrome_counter(z.check_str)'''  ,		setup='''import __main__ as z'''  ,		)  ,		'''seconds'''  ,		)
						print(
						    '''> can_string_be_rearranged_as_palindrome()'''  ,		'''\tans ='''  ,		can_string_be_rearranged_as_palindrome(SCREAMING_SNAKE_CASE__       )  ,		'''\ttime ='''  ,		timeit(
						        '''z.can_string_be_rearranged_as_palindrome(z.check_str)'''  ,		setup='''import __main__ as z'''  ,		)  ,		'''seconds'''  ,		)


if __name__ == "__main__":
					lowerCAmelCase_       	=	input(
					    '''Enter string to determine if it can be rearranged as a palindrome or not: '''
					).strip()
					benchmark(check_str)
					lowerCAmelCase_       	=	can_string_be_rearranged_as_palindrome_counter(check_str)
					print(f"""{check_str} can {"" if status else "not "}be rearranged as a palindrome""")


import math


def   __SCREAMING_SNAKE_CASE					(SCREAMING_SNAKE_CASE__  ,		SCREAMING_SNAKE_CASE__       ):
						if 0 not in (x, y):
												# We use the relation x^y = y*log10(x), where 10 is the base.
												return y * math.logaa(SCREAMING_SNAKE_CASE__       )
						else:
												if x == 0:  # 0 raised to any number is 0
																		return 0
												elif y == 0:
																		return 1  # any number raised to 0 is 1
						raise AssertionError('''This should never happen'''       )


if __name__ == "__main__":  # Main function
					# Read two numbers from input and typecast them to int using map function.
					# Here x is the base and y is the power.
					lowerCAmelCase_       	=	'''Enter the base and the power separated by a comma: '''
					lowerCAmelCase_	,      lowerCAmelCase_       	=	map(int, input(prompt).split(''','''))
					lowerCAmelCase_	,      lowerCAmelCase_       	=	map(int, input(prompt).split(''','''))

					# We find the log of each number, using the function res(), which takes two
					# arguments.
					lowerCAmelCase_       	=	res(xa, ya)
					lowerCAmelCase_       	=	res(xa, ya)

					# We check for the largest number
					if resa > resa:
										print('''Largest number is''', xa, '''^''', ya)
					elif resa > resa:
										print('''Largest number is''', xa, '''^''', ya)
					else:
										print('''Both are equal''')