def 					lowerCAmelCase_			(	__a		)					->		list:







  """simple docstring"""





  lowerCamelCase__:				Tuple        =False
  while is_sorted is False:  # Until all the indices are traversed keep looping
    lowerCamelCase__:				Optional[Any]        =True
    for i in range(0     ,   len(__a		) - 1     ,   2		):  # iterating over all even indices
      if input_list[i] > input_list[i + 1]:
        lowerCamelCase__:				Dict        =input_list[i + 1], input_list[i]
        # swapping if elements not in order
        lowerCamelCase__:				Union[str, Any]        =False

    for i in range(1     ,   len(__a		) - 1     ,   2		):  # iterating over all odd indices
      if input_list[i] > input_list[i + 1]:
        lowerCamelCase__:				int        =input_list[i + 1], input_list[i]
        # swapping if elements not in order
        lowerCamelCase__:				Tuple        =False
  return input_list


if __name__ == "__main__":
     print("Enter list to be sorted")
     __A     =    [int(x) for x in input().split()]
     # inputing elements of the list in one line
     __A     =    odd_even_sort(input_list)
     print("The sorted list is")
     print(sorted_list)








def 					lowerCAmelCase_			(	__a     ,   __a		)					->		Tuple:







  """simple docstring"""





  assert x is not None
  assert y is not None

  lowerCamelCase__:				Any        =len(__a		)
  lowerCamelCase__:				int        =len(__a		)

  # declaring the array for storing the dp values
  lowerCamelCase__:				List[Any]        =[[0] * (n + 1) for _ in range(m + 1		)]  # noqa: E741

  for i in range(1     ,   m + 1		):
    for j in range(1     ,   n + 1		):
      lowerCamelCase__:				str        =1 if x[i - 1] == y[j - 1] else 0

      lowerCamelCase__:				str        =max(l[i - 1][j]     ,   l[i][j - 1]     ,   l[i - 1][j - 1] + match		)

  lowerCamelCase__:				Any        =""
  lowerCamelCase__  , lowerCamelCase__:				str        =m, n
  while i > 0 and j > 0:
    lowerCamelCase__:				Union[str, Any]        =1 if x[i - 1] == y[j - 1] else 0

    if l[i][j] == l[i - 1][j - 1] + match:
      if match == 1:
        lowerCamelCase__:				Any        =x[i - 1] + seq
      i -= 1
      j -= 1
    elif l[i][j] == l[i - 1][j]:
      i -= 1
    else:
      j -= 1

  return l[m][n], seq


if __name__ == "__main__":
     __A     =    "AGGTAB"
     __A     =    "GXTXAYB"
     __A     =    4
     __A     =    "GTAB"

     __A ,     __A     =    longest_common_subsequence(a, b)
     print("len =", ln, ", sub-sequence =", subseq)
     import doctest

     doctest.testmod()

