We have N balls. The i-th ball has an integer A_i written on it.
For each k=1, 2, ..., N, solve the following problem and print the answer.

* Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.

Constraints

* 3 \leq N \leq 2 \times 10^5
* 1 \leq A_i \leq N
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 A_2 ... A_N


Output

For each k=1,2,...,N, print a line containing the answer.

Examples

Input

5
1 1 2 1 2


Output

2
2
3
2
3


Input

4
1 2 3 4


Output

0
0
0
0


Input

5
3 3 3 3 3


Output

6
6
6
6
6


Input

8
1 2 1 4 2 1 4 1


Output

5
7
5
7
7
5
7
5
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		BufferedReader bfr = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer str = new StringTokenizer(bfr.readLine());
		int n = Integer.parseInt(str.nextToken());
		str = new StringTokenizer(bfr.readLine());
		int[] arr = new int[n + 1];
		HashMap<Integer, Integer> list = new HashMap<Integer, Integer>();

		for (int i = 1; i <= n; i++) {
			int temp = Integer.parseInt(str.nextToken());
			arr[i] = temp;
			if (list.containsKey(temp)) {
				list.replace(temp, list.get(temp) + 1);
			} else {
				list.put(temp, 1);
			}
		}
		long sum = 0;
		for(int temp : list.keySet()) {
			int tmp = list.get(temp);
			sum+=1L*tmp*(tmp-1)/2;
		}
		for (int i = 1; i <= n; i++) {
			int temp = arr[i];
			long answer = sum - (list.get(temp)-1);
			System.out.println(answer);
		}

	}

}
