"""simple docstring"""







from collections import Counter
from timeit import timeit
def 						__UpperCAmelCase       (					UpperCAmelCase_					:       str = ""    ,							)							->    bool:

 '''simple docstring'''





 return sum(c % 2 for c in Counter(input_str.replace(' '    ,							''						).lower()						).values()						) < 2
def 						__UpperCAmelCase       (					UpperCAmelCase_					:       str = ""						)							->    bool:

 '''simple docstring'''





 if len(UpperCAmelCase_						) == 0:
  return True
 __snake_case    :							Optional[int]   	=				input_str.replace(' '    ,							''						).lower()
 # character_freq_dict: Stores the frequency of every character in the input string
 __snake_case    :							dict[str, int]   	=				{}

 for character in lower_case_input_str:
  __snake_case    :							str   	=				character_freq_dict.get(UpperCAmelCase_    ,							0						) + 1
 __snake_case    :							List[Any]   	=				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 						__UpperCAmelCase       (					UpperCAmelCase_					:       str = ""						)							->    None:

 '''simple docstring'''





 print('\nFor string = '    ,							UpperCAmelCase_    ,							':'						)
 print(
     '> can_string_be_rearranged_as_palindrome_counter()'    ,							'\tans ='    ,							can_string_be_rearranged_as_palindrome_counter(UpperCAmelCase_						)    ,							'\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(UpperCAmelCase_						)    ,							'\ttime ='    ,							timeit(
         'z.can_string_be_rearranged_as_palindrome(z.check_str)'    ,							setup='import __main__ as z'    ,							)    ,							'seconds'    ,							)


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






"""simple docstring"""







import math
def 						__UpperCAmelCase       (					UpperCAmelCase_					:       list    ,							UpperCAmelCase_					:       int						)							->    int:

	'''simple docstring'''





	__snake_case    :							List[str]   	=				len(UpperCAmelCase_						)
	__snake_case    :							List[Any]   	=				int(math.floor(math.sqrt(UpperCAmelCase_						)						)						)
	__snake_case    :							Any   	=				0
	while arr[min(UpperCAmelCase_    ,							UpperCAmelCase_						) - 1] < x:
		__snake_case    :							Tuple   	=				step
		step += int(math.floor(math.sqrt(UpperCAmelCase_						)						)						)
		if prev >= n:
			return -1

	while arr[prev] < x:
		__snake_case    :							Union[str, Any]   	=				prev + 1
		if prev == min(UpperCAmelCase_    ,							UpperCAmelCase_						):
			return -1
	if arr[prev] == x:
		return prev
	return -1


if __name__ == "__main__":
	_a  :  str=				input("Enter numbers separated by a comma:\n").strip()
	_a  :  int=				[int(item) for item in user_input.split(",")]
	_a  :  Optional[Any]=				int(input("Enter the number to be searched:\n"))
	_a  :  Tuple=				jump_search(arr, x)
	if res == -1:
		print("Number not found!")
	else:
		print(f'''Number {x} is at index {res}''')





