

"""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)









"""simple docstring"""



def  _snake_case     (    UpperCAmelCase_  :					list			):
     if len(UpperCAmelCase_			) <= 1:
          return lst

     A__										=  1

     while i < len(UpperCAmelCase_			):
          if lst[i - 1] <= lst[i]:
               i += 1
          else:
               A__			,				A__										=  lst[i], lst[i - 1]
               i -= 1
               if i == 0:
                    A__										=  1

     return lst


if __name__ == "__main__":
 SCREAMING_SNAKE_CASE_					:	Union[str, Any]							  =						input('Enter numbers separated by a comma:\n').strip()
 SCREAMING_SNAKE_CASE_					:	Union[str, Any]							  =						[int(item) for item in user_input.split(',')]
 print(gnome_sort(unsorted))






