def lps(str):
    n = len(str)
    if n == 0:
        return ""
    dp = [[""] * n for _ in range(n)]
    for i in range(n):
        dp[i][i] = str[i]
    for length in range(2, n + 1):
        for i in range(n - length + 1):
            j = i + length - 1
            if str[i] == str[j]:
                if length == 2:
                    dp[i][j] = str[i] + str[j]
                else:
                    dp[i][j] = str[i] + dp[i + 1][j - 1] + str[j]
            else:
                a = dp[i + 1][j]
                b = dp[i][j - 1]
                if len(a) > len(b):
                    dp[i][j] = a
                elif len(b) > len(a):
                    dp[i][j] = b
                else:
                    dp[i][j] = a if a <= b else b
    return dp[0][n - 1]