def      _a					(   lowercase__	:      str			):







     '''simple docstring'''


     SCREAMING_SNAKE_CASE__					:					Optional[Any]      =		[0] * len(lowercase__			)

     for i in range(1  ,	len(lowercase__			)			):
          # use last results for better performance - dynamic programming
          SCREAMING_SNAKE_CASE__					:					Dict      =		prefix_result[i - 1]
          while j > 0 and input_string[i] != input_string[j]:
               SCREAMING_SNAKE_CASE__					:					Union[str, Any]      =		prefix_result[j - 1]

          if input_string[i] == input_string[j]:
               j += 1
          SCREAMING_SNAKE_CASE__					:					str      =		j

     return prefix_result







def      _a					(   lowercase__	:      str			):







     '''simple docstring'''


     return max(prefix_function(lowercase__			)			)


if __name__ == "__main__":
      import doctest

      doctest.testmod()









"""simple docstring"""




def        a__					(							snake_case__							)		->   list:

			if len(snake_case__							) <= 1:
						return [tuple(snake_case__							)]

			lowerCamelCase      =   []

			def generate(snake_case__			,					snake_case__							):
						lowerCamelCase      =   [0] * n
						res.append(tuple(snake_case__							)							)

						lowerCamelCase      =   0
						while i < n:
									if c[i] < i:
												if i % 2 == 0:
															lowerCamelCase ,  lowerCamelCase      =   arr[i], arr[0]
												else:
															lowerCamelCase ,  lowerCamelCase      =   arr[i], arr[c[i]]
												res.append(tuple(snake_case__							)							)
												c[i] += 1
												lowerCamelCase      =   0
									else:
												lowerCamelCase      =   0
												i += 1

			generate(len(snake_case__							)			,					snake_case__							)
			return res


if __name__ == "__main__":
					lowerCAmelCase				:     str					=				input("""Enter numbers separated by a comma:\n""").strip()
					lowerCAmelCase				:     List[Any]					=				[int(item) for item in user_input.split(""",""")]
					print(heaps(arr))



