


from __future__ import annotations




def  a   (lowerCAmelCase__		,				lowerCAmelCase__ = None   ):
   __a					=  word_bank or []
   # create a table
   __a					=  len(lowerCAmelCase__   ) + 1

   __a					=  []
   for _ in range(lowerCAmelCase__   ):
      table.append([]   )
   # seed value
   __a					=  [[]]  # because empty string has empty combination

   # iterate through the indices
   for i in range(lowerCAmelCase__   ):
      # condition
      if table[i] != []:
         for word in word_bank:
            # slice condition
            if target[i : i + len(lowerCAmelCase__   )] == word:
               __a					=  [
                   [word, *way] for way in table[i]
               ]
               # adds the word to every combination the current position holds
               # now,push that combination to the table[i+len(word)]
               table[i + len(lowerCAmelCase__   )] += new_combinations

    # combinations are in reverse order so reverse for better output
   for combination in table[len(lowerCAmelCase__   )]:
      combination.reverse()

   return table[len(lowerCAmelCase__   )]


if __name__ == "__main__":
  print(all_construct('jwajalapa', ['jwa', 'j', 'w', 'a', 'la', 'lapa']))
  print(all_construct('rajamati', ['s', 'raj', 'amat', 'raja', 'ma', 'i', 't']))
  print(
      all_construct(
          'hexagonosaurus',
          ['h', 'ex', 'hex', 'ag', 'ago', 'ru', 'auru', 'rus', 'go', 'no', 'o', 's'],
      )
  )







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

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


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



