//#include <bits/stdc++.h>
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI;//例: VVI dp(10, vector<int>(10, INF);
typedef priority_queue<int, vector<int>, less<int> > QUE_int;
const int INF = 2 * pow(10, 9) + 1;//+1しないとREになるかも(out of rangeになるんかな?? )

vector<int> dx = { -1, 0, 1, 0, -1, -1, 1, 1 };
vector<int> dy = { 0, -1, 0, 1, -1, 1, -1, 1 };

ll max(ll a, ll b) { return (a > b) ? a : b; }
ll min(ll a, ll b) { return (a < b) ? a : b; }

////////////////////////////////////////////////////////////////

// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = pow(10, 9) + 7;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
	vector<mint> fact, ifact;
	combination(int n) :fact(n + 1), ifact(n + 1) {
		assert(n < mod);
		fact[0] = 1;
		for (int i = 1; i <= n; ++i) fact[i] = fact[i - 1] * i;
		ifact[n] = fact[n].inv();
		for (int i = n; i >= 1; --i) ifact[i - 1] = ifact[i] * i;
	}
	mint operator()(int n, int k) {
		if (k < 0 || k > n) return 0;
		return fact[n] * ifact[k] * ifact[n - k];
	}
};


////////////////////////////////////////////////////////////////

int main(void) {
	ll N;
	cin >> N;
	vector<ll> A(N);
	for(ll i=0; i<N; i++) cin >> A[i];
	
	//sort(A.begin(), A.end());
	map<ll, ll> mp;
	for(ll i=0; i<N; i++){
		mp[A[i]]++;
	}


	ll all_convi = 0;// k番目すら取り除かない　場合の答え
	
	auto begin = mp.begin(), end = mp.end();
	for (auto iter = begin; iter != end; iter++) {
		// first: key, second: value
		//cout << "key = " << iter->first << "\n";
		//cout << "value = " << iter->second << "\n";
		ll num = iter->second;
		all_convi += num * (num-1) /2 ;

	}

	//cout << "mp.size(): " << mp.size() << endl;
	map<ll, ll> ans;
	for (auto iter = begin; iter != end; iter++) {
		// first: key, second: value
		//cout << "key = " << iter->first << "\n";
		//cout << "value = " << iter->second << "\n";
		ll num = iter->second;
		ll key = iter->first;
		ans[key] = all_convi;
		ans[key] -= num*(num-1) /2;
		ans[key] += (num-1) * (num-2) /2;
	}
	/*
	vector<ll> ans(mp.size(), -1);
	ll i= 0;
	for (auto iter = begin; iter != end; iter++) {
		// first: key, second: value
		//cout << "key = " << iter->first << "\n";
		//cout << "value = " << iter->second << "\n";
		ll num = iter->second;
		ans[i] = all_convi;
		ans[i] -= num*(num-1) /2;
		ans[i] += (num-1) * (num-2) /2;
		i++;

	}
 	*/



	for(ll i=0; i<N; i++){
		cout << ans[A[i]] << endl;
	}
 


	return 0;
}




Measured memory_bytes: 18944