





'''simple docstring'''




def 	_lowerCAmelCase      (  __snake_case  :			str			,							__snake_case  :			str      )					->					int:
     if len(__snake_case      ) != len(__snake_case      ):
          raise ValueError('String lengths must match!'      )

     __A						:			Tuple								=	0

     for chara, chara in zip(__snake_case			,							__snake_case      ):
          if chara != chara:
               count += 1

     return count


if __name__ == "__main__":
  import doctest

  doctest.testmod()






'''simple docstring'''




def 	_lowerCAmelCase      (  __snake_case  :			str      )					->					str:
     __A						:			Optional[Any]								=	[0] * len(__snake_case      )
     __A						:			Dict								=	[]
     __A						:			Optional[int]								=	[1] * len(__snake_case      )

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

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

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

               if long_dist[vertex] + 1 > long_dist[x]:
                    __A						:			str								=	long_dist[vertex] + 1

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

     print(max(__snake_case      )      )


# Adjacency list of Graph
lowercase__   :				Dict      =   {0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}







longest_distance(graph)