Dima got into number sequences. Now he's got sequence a1, a2, ..., an, consisting of n positive integers. Also, Dima has got a function f(x), which can be defined with the following recurrence:

  * f(0) = 0; 
  * f(2·x) = f(x); 
  * f(2·x + 1) = f(x) + 1. 



Dima wonders, how many pairs of indexes (i, j) (1 ≤ i < j ≤ n) are there, such that f(ai) = f(aj). Help him, count the number of such pairs. 

Input

The first line contains integer n (1 ≤ n ≤ 105). The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).

The numbers in the lines are separated by single spaces.

Output

In a single line print the answer to the problem.

Please, don't use the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

Examples

Input

3
1 2 4


Output

3


Input

3
5 3 1


Output

1

Note

In the first sample any pair (i, j) will do, so the answer is 3.

In the second sample only pair (1, 2) will do.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.StringTokenizer;


public class B {
	private BufferedReader in;
	private PrintWriter out;
	private StringTokenizer st;
	private BigInteger[][] c;

	void run() throws IOException {
		in = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(new OutputStreamWriter(System.out));

		solve();

		in.close();
		out.close();
	}

	int getCnt1(long a){
		int res = 0;
		for (int i = 0; i < 32; i++){
			long t = 1 << i;
			if (t == (a & t))
				res++;
		}
		return res;
	}
//	
//	BigInteger getFact(long n){
//		BigInteger res = new BigInteger("1");
//		for (int i = 1; i <= n; i++)
//			res = res.multiply(BigInteger.valueOf(i));
//		return res;
//	}
	
	BigInteger cn2(long n){
		return c[(int)n][2];
//		return getFact(n).divide(BigInteger.valueOf(2).multiply(getFact(n - 2)));
//		return getFact(n)/(2 * getFact(n - 2));
	}
	
	void solve() throws IOException {
//		out.println(1 << 64);
		int n = nextInt();
		long[] cnt = new long[1000];
		for (int i = 0; i < n; i++){
			long r = nextLong();
			cnt[getCnt1(r)]++;
		}
		BigInteger res = new BigInteger("0");
		c = new BigInteger[n + 1][10];
		for (int i = 0; i <= n; i++)
			for (int j = 0; j <= Math.min(3, i); j++)
				if (j == 0 || j == i)
					c[i][j] = new BigInteger("1");
				else
					c[i][j] = c[i - 1][j].add(c[i - 1][j - 1]);
		for (int i = 0; i < 1000; i++){
			if (cnt[i] > 2)
				res = res.add(cn2(cnt[i]));
			if (cnt[i] == 2)
				res = res.add(BigInteger.valueOf(1));
		}
		out.println(res.toString());
	}

	public static void main(String[] args) throws IOException {
		new B().run();
	}

	String nextToken() throws IOException {
		while (st == null || !st.hasMoreTokens())
			st = new StringTokenizer(in.readLine());
		return st.nextToken();
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

}
