



'''simple docstring'''


from collections import defaultdict







def 				__lowerCamelCase				(   A__    ,						A__    )       ->	bool:






   """simple docstring"""
   UpperCamelCase					=  first_str.lower().strip()
   UpperCamelCase					=  second_str.lower().strip()

   # Remove whitespace
   UpperCamelCase					=  first_str.replace(' '    ,						''    )
   UpperCamelCase					=  second_str.replace(' '    ,						''    )

   # Strings of different lengths are not anagrams
   if len(A__    ) != len(A__    ):
      return False

   # Default values for count should be 0
   UpperCamelCase					=  defaultdict(A__    )

   # For each character in input strings,
   # increment count in the corresponding
   for i in range(len(A__    )    ):
      count[first_str[i]] += 1
      count[second_str[i]] -= 1

   return all(_count == 0 for _count in count.values()    )


if __name__ == "__main__":
   from doctest import testmod

   testmod()
   _lowerCamelCase	:       Union[str, Any]      	=	input("Enter the first string ").strip()
   _lowerCamelCase	:       List[Any]      	=	input("Enter the second string ").strip()

   _lowerCamelCase	:       Any      	=	check_anagrams(input_a, input_b)
   print(f'''{input_a} and {input_b} are {'' if status else 'not '}anagrams.''')






'''simple docstring'''


def 				__lowerCamelCase				(   A__    )       ->	list:






   """simple docstring"""
   UpperCamelCase					=  len(A__    )
   for i in range(1    ,						A__    ):
      UpperCamelCase					=  collection[i]
      UpperCamelCase					=  0
      UpperCamelCase					=  i - 1

      while low <= high:
         UpperCamelCase					=  (low + high) // 2
         if val < collection[mid]:
            UpperCamelCase					=  mid - 1
         else:
            UpperCamelCase					=  mid + 1
      for j in range(A__    ,						A__    ,						-1    ):
         UpperCamelCase					=  collection[j - 1]
      UpperCamelCase					=  val
   return collection


if __name__ == "__main__":
   _lowerCamelCase	:       int      	=	input("Enter numbers separated by a comma:\n").strip()
   _lowerCamelCase	:       Union[str, Any]      	=	[int(item) for item in user_input.split(",")]
   print(binary_insertion_sort(unsorted))

