def solution(numbers):
    n = len(numbers)

    for i in range(n):
        if numbers == numbers[::-1]:
            return i, numbers[n:]

        numbers.insert(n, numbers[i])


def solution_faster(numbers):
    for i, _ in enumerate(numbers):
        seq = numbers[i:]

        if seq == seq[::-1]:
            return i, numbers[:i]


def solution_fastest(numbers):
    n = len(numbers)

    for i in range(n):
        if all(numbers[j] == numbers[i-j-1] for j in range(i, (i + n) // 2)):
            return i, numbers[:i]

tests = (
	[1, 2, 3, 4, 5, 4, 3, 2, 1],
	[1, 2, 1, 2, 2],
	[1, 2, 3, 4, 5],
)

for test in tests:
	assert solution(test) == solution_faster(test)
	assert solution(test) == solution_fastest(test)

	n, seq = solution(test)
	print(n, seq)