def longest_palindrome(s):
    ss = sorted([s[i:j+1] for i in xrange(int(round(len(s)/2)+1)) for j in xrange(i,len(s))], key=len)[::-1]
    return len((item for item in ss if item in item[::-1]).next()) if ss else 0