 
def solve(s):
    n = len(s)
    dp = [0] * n

    for i in range(n):
        u = {}

        for j in range(i, -1, -1):
            u[s[j]] = u.get(s[j], 0) + 1

            cost = len(u)

            if j == 0:
                dp[i] = max(dp[i], cost)
            else:
                dp[i] = max(dp[i], cost + dp[j - 1])

    return dp[n - 1]


# Test input
s = "abcabc"

print(solve(s))
