import java.util.Arrays;
import java.util.Scanner;

import static java.lang.Math.max;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        String[] s = new String[n];
        long count = 0;
        int tmpCount = 1;

        for (int i = 0; i < n; i++) {
            char[] tmp = scanner.next().toCharArray();
            Arrays.sort(tmp);
            s[i] = String.valueOf(tmp);
        }

        Arrays.sort(s);

        for (int i = 1; i < n; i++) {
            if(s[i-1].equals(s[i])) {
                count += tmpCount;
                tmpCount++;
            } else {
                tmpCount = 1;
            }
        }
        System.out.println(count);

    }

}


/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz