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.util.HashMap;
import java.util.Map;
import java.util.Scanner;

	// https://atcoder.jp/contests/abc159/tasks/abc159_d
	public class Main {

		public static void main(String[] args) {
			// TODO 自動生成されたメソッド・スタブ

			Scanner sc = new Scanner(System.in);
			int N = sc.nextInt();

			HashMap<String, Long> map = new HashMap<>();
			String[] arrayA = new String[N];
			for (int i = 0; i < N; i++) {
				arrayA[i] = sc.next();
				String str = arrayA[i];
				if (map.containsKey(str)) {
					map.put(str, map.get(str)+1);
				} else {
					map.put(str,1L);
				}
			}
			sc.close();

			long ans1 = 0;
			for (Map.Entry<String, Long> bar : map.entrySet()) {
				Long a = bar.getValue();
				ans1 = ans1 + a*(a-1)/2;
			}

			for(int k=0;k<N;k++) {
				long ans = ans1;
				String number = arrayA[k];
				Long a = map.get(number);
				if(a!=0) {
					ans = ans - a*(a-1)/2 + (a-1)*(a-2)/2;
				}
				System.out.println(ans);
			}
		}
	}
