def substring_palindrome(S):
    L = len(S)
    for i in range(L):
        # 奇数長
        j = 0
        while 0 <= i - j and i + j < L:
            if S[i - j] == S[i + j]:
                yield i - j, i + j
                j += 1
            else:
                break
        # 偶数長
        j = 0
        while 0 <= i - j and i + j + 1 < L:
            if S[i - j] == S[i + j + 1]:
                yield i - j, i + j + 1
                j += 1
            else:
                break


S = input()

L = len(S)
P, PP, PPA, PPAP = ([0] * L for _ in range(4))
table = [[False] * L for _ in range(L)]
for p,q in substring_palindrome(S):
    table[p][q] = True

for i in range(L):
    # PPAP
    for j in range(i + 1):
        if table[j][i]:
            PPAP[i] += PPA[j - 1]

    # PPA
    PPA[i] += sum(PP[:i])

    # PP
    for j in range(i + 1):
        if table[j][i]:
            PP[i] += P[j - 1]

    # P
    if table[0][i]:
        P[i] += 1

print(PPAP[-1])