class BIT:
    def __init__(self, N):
        self.size = N
        self.tree = [0] * (N + 1)

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

    @staticmethod
    def inversion_number(A, N):
        memo = {n: i for i, n in enumerate(sorted(set(A)), 1)}
        bit = BIT(N)
        ans = 0
        for i, a in enumerate(A):
            bit.add(memo[a], 1)
            ans += i + 1 - bit.sum(memo[a])
        return ans

    def __str__(self):
        return "BIT: [{}]".format(
            ", ".join(str(self.sum(i + 1) - self.sum(i))
                      for i in range(self.size))
        )


S = input()
print(BIT.inversion_number(S, len(S)))