import regex

class Solution:
    # @return a string
    def longestPalindrome(self, s):


    def findRecursive(self, s, len):
        len = 0



if __name__ == "__main__":
    str_1 = "abdccdbaadd"
    solution = Solution()
    print solution.longestPalindrome(str_1)