def solution(s):
answer = 0
if len(s)>1:
for i in range(len(s)-1):
for j in range(len(s)):
if s[i:j+1]==s[i:j+1][::-1]:
answer=max(answer, len(s[i:j+1]))
else:
answer=1
return answer
def solution(s):
for i in range(len(s),0,-1):
for j in range(len(s)-i+1):
if s[j:j+i] == s[j:j+i][::-1]:
return i