-- coding:utf-8 --

class Solution:
def getLongestPalindrome(self, A, n):
# write code here
if n <= 1:
return n
sub_len = n
while sub_len > 1:
for i in range(n - sub_len +1):
sub_a = A[i:i + sub_len]
if A[i] == A[i+sub_len-1] and sub_a == sub_a[::-1]:
return len(sub_a)
sub_len -= 1
return A[0]