def is_palindrome(s):
if len(s)==1:
return True
mid = len(s)//2
if len(s)%2 == 0:
if s[:mid] == s[mid:][::-1]:
return True
else:
if s[:mid] == s[mid+1:][::-1]:
return True
def solution(s):
max = 0
for i in range(len(s)):
for j in range(i, len(s)):
temp = s[i:j+1]
if is_palindrome(temp):
if len(temp) > max:
max = len(temp)
return max