

'''simple docstring'''
def 	_lowerCAmelCase (						_UpperCamelCase						:					Optional[int]    ):
     """simple docstring"""




     return [
         {
             0: [1, 2],
             1: [0, 2],
             2: [0, 1, 3, 5],
             3: [2, 4],
             4: [3],
             5: [2, 6, 8],
             6: [5, 7],
             7: [6, 8],
             8: [5, 7],
         },
         {
             0: [6],
             1: [9],
             2: [4, 5],
             3: [4],
             4: [2, 3],
             5: [2],
             6: [0, 7],
             7: [6],
             8: [],
             9: [1],
         },
         {
             0: [4],
             1: [6],
             2: [],
             3: [5, 6, 7],
             4: [0, 6],
             5: [3, 8, 9],
             6: [1, 3, 4, 7],
             7: [3, 6, 8, 9],
             8: [5, 7],
             9: [5, 7],
         },
         {
             0: [1, 3],
             1: [0, 2, 4],
             2: [1, 3, 4],
             3: [0, 2, 4],
             4: [1, 2, 3],
         },
     ][index]


def 	_lowerCAmelCase (						_UpperCamelCase						:					dict[int, list[int]]    ):
     """simple docstring"""




     _SCREAMING_SNAKE_CASE							   =0
     _SCREAMING_SNAKE_CASE							   =len(_UpperCamelCase    )  # No of vertices in graph
     _SCREAMING_SNAKE_CASE							   =[0] * n
     _SCREAMING_SNAKE_CASE							   =[False] * n

     def dfs(_UpperCamelCase						:					str							,			_UpperCamelCase						:					Dict							,			_UpperCamelCase						:					List[Any]							,			_UpperCamelCase						:					Union[str, Any]    ):
          _SCREAMING_SNAKE_CASE							   =True
          _SCREAMING_SNAKE_CASE							   =id_
          id_ += 1
          for to in graph[at]:
               if to == parent:
                    pass
               elif not visited[to]:
                    dfs(_UpperCamelCase							,			_UpperCamelCase							,			_UpperCamelCase							,			id_    )
                    _SCREAMING_SNAKE_CASE							   =min(low[at]							,			low[to]    )
                    if id_ <= low[to]:
                         bridges.append((at, to) if at < to else (to, at)    )
               else:
                    # This edge is a back edge and cannot be a bridge
                    _SCREAMING_SNAKE_CASE							   =min(low[at]							,			low[to]    )

     _SCREAMING_SNAKE_CASE							   =[]
     for i in range(_UpperCamelCase    ):
          if not visited[i]:
               dfs(_UpperCamelCase							,			-1							,			_UpperCamelCase							,			id_    )
     return bridges


if __name__ == "__main__":
     import doctest

     doctest.testmod()



'''simple docstring'''
def 	_lowerCAmelCase (						_UpperCamelCase						:					str    )				->      bool:
     """simple docstring"""




     _SCREAMING_SNAKE_CASE							   =0
     for ch in input_str:
          _SCREAMING_SNAKE_CASE							   =ord(_UpperCamelCase    )
          _SCREAMING_SNAKE_CASE							   =pow(2							,			_UpperCamelCase    )

          # If we already turned on bit for current character's unicode
          if bitmap >> ch_unicode & 1 == 1:
               return False
          bitmap |= ch_bit_index_on
     return True


if __name__ == "__main__":
     import doctest

     doctest.testmod()
