

"""simple docstring"""



from collections import defaultdict





def  _snake_case     (    UpperCAmelCase_  :					int			):
     A__										=  1
     A__										=  True
     for v in tree[start]:
          if v not in visited:
               ret += dfs(UpperCAmelCase_			)
     if ret % 2 == 0:
          cuts.append(UpperCAmelCase_			)
     return ret





def  _snake_case     (    ):
     dfs(1			)


if __name__ == "__main__":
 SCREAMING_SNAKE_CASE_  ,SCREAMING_SNAKE_CASE_					:	Any							  =						1_0, 9
 SCREAMING_SNAKE_CASE_					:	Any							  =						defaultdict(list)
 SCREAMING_SNAKE_CASE_					:	dict[int, bool]							  =						{}
 SCREAMING_SNAKE_CASE_					:	list[int]							  =						[]
 SCREAMING_SNAKE_CASE_					:	Optional[int]							  =						0
 SCREAMING_SNAKE_CASE_					:	Any							  =						[(2, 1), (3, 1), (4, 3), (5, 2), (6, 1), (7, 2), (8, 6), (9, 8), (1_0, 8)]
 for u, v in edges:
  tree[u].append(v)
  tree[v].append(u)
 even_tree()
 print(len(cuts) - 1)









"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					List[str]			):
     A__										=  [0] * len(UpperCAmelCase_			)
     A__										=  []
     A__										=  [1] * len(UpperCAmelCase_			)

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

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

     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(UpperCAmelCase_			)

     print(max(UpperCAmelCase_			)			)


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

longest_distance(graph)






