# Python3 program to find
# palindromic string
from collections import defaultdict

def getCount(N, s):

    # Stores frequency array
    # and its count
    mp = defaultdict(lambda: 0)

    # Total number of pairs
    ans = 0

    for i in range(N):

        # Initializing array of size 26
        # to store count of character
        a = [0] * 26

        # Counting occurrence of each
        # character of current string
        for j in range(len(s[i])):
            a[ord(s[i][j]) - ord('a')] += 1

        # Convert each count to parity(0 or 1)
        # on the basis of its frequency
        for j in range(26):
            a[j] = a[j] % 2

        # Adding to answer
        ans += mp[tuple(a)]

        # Frequency of single character
        # can be possibly changed,
        # so change its parity
        for j in range(26):
            changedCount = a[:]
            if (a[j] == 0):
                changedCount[j] = 1
            else:
                changedCount[j] = 0
            ans += mp[tuple(changedCount)]

        mp[tuple(a)] += 1

    return ans

# Driver code
if __name__ == '__main__':

    N = 4
    A = [ "ball", "all", "call", "bal" ]

    print(getCount(N, A))

# This code is contributed by Shivam Singh