



"""simple docstring"""





def      a__			(   lowerCAmelCase__   ):
      UpperCAmelCase_    				=							[0] * len(lowerCAmelCase__   )
      UpperCAmelCase_    				=							[]
      UpperCAmelCase_    				=							[1] * len(lowerCAmelCase__   )

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

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

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

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

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

      print(max(lowerCAmelCase__   )   )


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


longest_distance(graph)









"""simple docstring"""





from __future__ import annotations
def      a__			(   lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__   ):
      UpperCAmelCase_    				=							[]
      UpperCAmelCase_				,					UpperCAmelCase_    				=							input_list[low:mid], input_list[mid : high + 1]
      while left and right:
            result.append((left if left[0] <= right[0] else right).pop(0   )   )
      UpperCAmelCase_    				=							result + left + right
      return input_list
def      a__			(   lowerCAmelCase__   ):
      if len(lowerCAmelCase__   ) <= 1:
            return input_list
      UpperCAmelCase_    				=							list(lowerCAmelCase__   )

      # iteration for two-way merging
      UpperCAmelCase_    				=							2
      while p <= len(lowerCAmelCase__   ):
            # getting low, high and middle value for merge-sort of single list
            for i in range(0			,    len(lowerCAmelCase__   )			,    lowerCAmelCase__   ):
                  UpperCAmelCase_    				=							i
                  UpperCAmelCase_    				=							i + p - 1
                  UpperCAmelCase_    				=							(low + high + 1) // 2
                  UpperCAmelCase_    				=							merge(lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__			,    lowerCAmelCase__   )
            # final merge of last two parts
            if p * 2 >= len(lowerCAmelCase__   ):
                  UpperCAmelCase_    				=							i
                  UpperCAmelCase_    				=							merge(lowerCAmelCase__			,    0			,    lowerCAmelCase__			,    len(lowerCAmelCase__   ) - 1   )
                  break
            p *= 2

      return input_list


if __name__ == "__main__":
  lowerCamelCase      =		input("""Enter numbers separated by a comma:\n""").strip()
  if user_input == "":
    lowerCamelCase      =		[]
  else:
    lowerCamelCase      =		[int(item.strip()) for item in user_input.split(""",""")]
  print(iter_merge_sort(unsorted))




