



'''simple docstring'''


def 				__lowerCamelCase				(   A__    ,						A__    )       ->	str:






   """simple docstring"""
   if a < 0 or b < 0:
      raise ValueError('the value of both inputs must be positive'    )

   UpperCamelCase					=  str(bin(A__    )    )[2:]  # remove the leading "0b"
   UpperCamelCase					=  str(bin(A__    )    )[2:]  # remove the leading "0b"

   UpperCamelCase					=  max(len(A__    )    ,						len(A__    )    )

   return "0b" + "".join(
       str(int(char_a == '1' and char_b == '1'    )    )
       for char_a, char_b in zip(a_binary.zfill(A__    )    ,						b_binary.zfill(A__    )    )    )


if __name__ == "__main__":
   import doctest

   doctest.testmod()







def SCREAMING_SNAKE_CASE				(       lowercase_						)   ->       Any:



       """simple docstring"""

       A__       =    [0] * len(lowercase_						)
       A__       =    []
       A__       =    [1] * len(lowercase_						)

       for values in graph.values():
              for i in values:
                     indegree[i] += 1

       for i in range(len(lowercase_						)						):
              if indegree[i] == 0:
                     queue.append(lowercase_						)

       while queue:
              A__       =    queue.pop(0						)
              for x in graph[vertex]:
                     indegree[x] -= 1

                     if long_dist[vertex] + 1 > long_dist[x]:
                            A__       =    long_dist[vertex] + 1

                     if indegree[x] == 0:
                            queue.append(lowercase_						)

       print(max(lowercase_						)						)


# Adjacency list of Graph
_lowerCamelCase	:		Optional[int]							       =   {0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}
longest_distance(graph)


