import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def ceil(A,B):
    return -(-A//B)
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(sys.stdin.readline().rstrip())
    def IC(): return [int(c) for c in sys.stdin.readline().rstrip()]
    def MI(): return map(int, sys.stdin.readline().split())
    S = LC()
    N = len(S)
    Alpha = {}
    # 大文字
    for i in range(65, 91):
        Alpha[chr(i)] = i - 65
    A = [0]*N
    for i,s in enumerate(S):
        A[i] = Alpha[s]
    Fsum = 0
    F = [[0]*26 for i in range(N)]
    Frev = [[0]*26 for i in range(N)]
    Ans = 0
    for i in range(N)[::-1]:
        Frev[i][A[i]]+=1
        if(i<N-1):
            for j in range(26):
                Frev[i][j] += Frev[i+1][j]
    for i in range(N):
        if (0 < i):
            for j in range(26):
                F[i][j] += F[i - 1][j]
        Frev[i][A[i]]-=1

        Other = N-i-1
        Ans += F[i][A[i]]*(Other-Frev[i][A[i]])
        #print(i,F[i][A[i]],Other-Frev[i][A[i]])
        F[i][A[i]]+=1
    print(Ans)
    return
solve()