


def 			_a      (    __UpperCamelCase			):
     a_     :  Any				      =     [7_0_1, 3_0_1, 1_3_2, 5_7, 2_3, 1_0, 4, 1]
     for gap in gaps:
          for i in range(__UpperCamelCase	,	len(__UpperCamelCase			)			):
               a_     :  Optional[int]				      =     collection[i]
               a_     :  Dict				      =     i
               while j >= gap and collection[j - gap] > insert_value:
                    a_     :  int				      =     collection[j - gap]
                    j -= gap
               if j != i:
                    a_     :  List[str]				      =     insert_value
     return collection


if __name__ == "__main__":
       from doctest import testmod

       testmod()
       __lowerCamelCase   	=  input('''Enter numbers separated by a comma:\n''').strip()
       __lowerCamelCase   	=  [int(item) for item in user_input.split(''',''')]
       print(shell_sort(unsorted))







class 	a__						:

       def __init__( self   :  int   ,				lowerCamelCase_   :  int     ):
            a_     :  Dict				      =     data
            a_     :  int
            a_     :  Node



def 			_a      (    __UpperCamelCase			):
     a_     :  int				      =     0
     a_     :  Optional[Any]				      =     x



def 			_a      (    __UpperCamelCase	,	__UpperCamelCase			):
     a_      ,      a_     :  Dict				      =     find_set(__UpperCamelCase			), find_set(__UpperCamelCase			)
     if x == y:
          return

     elif x.rank > y.rank:
          a_     :  Tuple				      =     x
     else:
          a_     :  Optional[Any]				      =     y
          if x.rank == y.rank:
               y.rank += 1



def 			_a      (    __UpperCamelCase			):
     if x != x.parent:
          a_     :  Tuple				      =     find_set(x.parent			)
     return x.parent



def 			_a      (    __UpperCamelCase			):
     a_     :  List[Any]				      =     ({0, 1, 2}, {3, 4, 5})
     for s in sets:
          if node.data in s:
               return s
     a_     :  Union[str, Any]				      =     F'''{node.data} is not in {sets}'''
     raise ValueError(__UpperCamelCase			)



def 			_a      (    ):
     a_     :  int				      =     [Node(__UpperCamelCase			) for i in range(6			)]
     for v in vertex:
          make_set(__UpperCamelCase			)

     union_set(vertex[0]	,	vertex[1]			)
     union_set(vertex[1]	,	vertex[2]			)
     union_set(vertex[3]	,	vertex[4]			)
     union_set(vertex[3]	,	vertex[5]			)

     for nodea in vertex:
          for nodea in vertex:
               if find_python_set(__UpperCamelCase			).isdisjoint(find_python_set(__UpperCamelCase			)			):
                    assert find_set(__UpperCamelCase			) != find_set(__UpperCamelCase			)
               else:
                    assert find_set(__UpperCamelCase			) == find_set(__UpperCamelCase			)


if __name__ == "__main__":
       test_disjoint_set()



