Problem:
Score : 400 points

Problem Statement

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.

Sample Input 1

5
1 1 2 1 2

Sample Output 1

2
2
3
2
3

Consider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.

From these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.

Thus, the answer for k=1 is 2.

Sample Input 2

4
1 2 3 4

Sample Output 2

0
0
0
0

No two balls have equal numbers written on them.

Sample Input 3

5
3 3 3 3 3

Sample Output 3

6
6
6
6
6

Any two balls have equal numbers written on them.

Sample Input 4

8
1 2 1 4 2 1 4 1

Sample Output 4

5
7
5
7
7
5
7
5

Solution in C++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include<bits/stdc++.h>

typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);i++) // no semicoron
#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=(ll)(n)-1;i>0;i--)
#define FORD(i,a,b) for(ll i=(a);i>(b);i--)
#define ALL(x) (x).begin(),(x).end() //sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) //sizeをsize_tからllに直しておく

using namespace std;

int factorialMethod(int k){
    ll sum = 1;
    FOR(i, 1, k+1)
    {
        sum *= i;
    }
    return sum;
}

int main(){
    ll N;
    cin >> N;
    vector<int> A (N+1);
    vector<int> B (N+1);


    FOR(i, 0, N+1) B[i] = 0;

    FOR(i, 1, N+1){
        cin >> A[i];
        B[A[i]]++;
    }

    //FOR(i, 0, N+1) cout << B[i] << endl;

    ll sum = 0;
    ll fm;

    FOR(i, 1, N+1){
        //cout << "i: " << i << endl;
        B[A[i]] --;
        FOR(j, 1, N+1){
            if(B[j] != 0){
                //cout << "j: " << j << endl;
                //cout << "B[j]: " << B[j] << endl;
                fm = factorialMethod(B[j])/(2*factorialMethod(B[j] - 2));
                //cout << "fm: " << fm << endl;
                sum += fm;
            }
            //ll fm = 
            
        }
        cout << sum << endl;
        B[A[i]] ++;
        sum = 0;     
    }


}