


'''simple docstring'''







# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.






def 			lowercase				(_A					):







       """simple docstring"""







       _lowerCAmelCase    :							Optional[int]   			=       [False] * len(_A					)
       _lowerCAmelCase    :							int   			=       [-1] * len(_A					)

       def dfs(_A   ,						_A					):
              _lowerCAmelCase    :							Tuple   			=       True
              _lowerCAmelCase    :							str   			=       c
              for u in graph[v]:
                     if not visited[u]:
                            dfs(_A   ,						1 - c					)

       for i in range(len(_A					)					):
              if not visited[i]:
                     dfs(_A   ,						0					)

       for i in range(len(_A					)					):
              for j in graph[i]:
                     if color[i] == color[j]:
                            return False

       return True


# Adjacency list of graph
lowerCAmelCase    :     Union[str, Any]					=						{0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 4: []}
print(check_bipartite_dfs(graph))





'''simple docstring'''







from collections import Counter
from timeit import timeit






def 			lowercase				(_A = ""   ,						):







       """simple docstring"""







       return sum(c % 2 for c in Counter(input_str.replace(' '   ,						''					).lower()					).values()					) < 2






def 			lowercase				(_A = ""					):







       """simple docstring"""







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

       for character in lower_case_input_str:
              _lowerCAmelCase    :							Union[str, Any]   			=       character_freq_dict.get(_A   ,						0					) + 1
       _lowerCAmelCase    :							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 			lowercase				(_A = ""					):







       """simple docstring"""







       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    :     Tuple					=						input(
           """Enter string to determine if it can be rearranged as a palindrome or not: """
       ).strip()
       benchmark(check_str)
       lowerCAmelCase    :     Optional[Any]					=						can_string_be_rearranged_as_palindrome_counter(check_str)
       print(F'''{check_str} can {"" if status else "not "}be rearranged as a palindrome''')

