import numpy as np


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

    return table


S = input()

L = len(S)
P, PP, PPA, PPAP = (np.zeros(L, dtype=np.int64) for _ in range(4))
table = np.array(substring_palindrome(S))

for i in range(L):
    # PPAP
    PPAP[i] = np.sum(PPA[:-1] * table[1:, i])

    # PPA
    PPA[i] = np.sum(PP[:i])

    # PP
    PP[i] = np.sum(P[:-1] * table[1:, i])

    # P
    P[i] = table[0, i]

print(PPAP[-1])