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

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();

		HashMap<String, Long> map = new HashMap<>();
		int i;
		String key;
		char[] temp;

		for(i = 0; i < n; i++) {
			key = scan.next();
			temp = key.toCharArray();
			Arrays.sort(temp);
			key = new String(temp);

			if(map.containsKey(key)) {
				long sum = map.get(key);
				if(sum == 0)
					map.put(key, new Long(1));
				else
					map.put(key, map.get(key) + 1);
			}else {
				map.put(key, new Long(0));
			}
		}

		long ans = 0;
		for(long a: map.values()) {
			ans += ((1 + a) * a) / 2;
		}
		System.out.println(ans);
	}
}
/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