
from collections import Counter
from timeit import timeit







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







def      snake_case		(							UpperCAmelCase	:       str = ""   ):
				if len(a_   ) == 0:
								return True
				A	 =      input_str.replace(' ',						''   ).lower()
				# character_freq_dict: Stores the frequency of every character in the input string
				A	 =      {}

				for character in lower_case_input_str:
								A	 =      character_freq_dict.get(a_,						0   ) + 1
				A	 =      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      snake_case		(							UpperCAmelCase	:       str = ""   ):
				print('\nFor string = ',						a_,						':'   )
				print(
				    '> can_string_be_rearranged_as_palindrome_counter()',						'\tans =',						can_string_be_rearranged_as_palindrome_counter(a_   ),						'\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(a_   ),						'\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''')













from itertools import permutations







def      snake_case		(							UpperCAmelCase	:       tuple   ):
				if num[3] % 2 != 0:
								return False

				if (num[2] + num[3] + num[4]) % 3 != 0:
								return False

				if num[5] % 5 != 0:
								return False

				A	 =      [7, 11, 13, 17]
				for i, test in enumerate(UpperCAmelCase   ):
								if (num[i + 4] * 1_00 + num[i + 5] * 10 + num[i + 6]) % test != 0:
												return False
				return True







def      snake_case		(							UpperCAmelCase	:       int = 10   ):
				return sum(
				    int(''.join(map(UpperCAmelCase,						UpperCAmelCase   )   )   )
				    for num in permutations(range(UpperCAmelCase   )   )
				    if is_substring_divisible(UpperCAmelCase   )   )


if __name__ == "__main__":
					print(f'''{solution() = }''')





