#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(n); ++i)
#define rep2(i, s, n) for(int i=s; i<(n); ++i)
#define ALL(v) (v).begin(), (v).end()

using namespace std;

typedef long long ll;

static const int INTINF = (2147483647 >> 1); // 10^9 + 5000
static const ll LLINF = (9223372036854775807 >> 1);
static const int MAX = 2e5+20;
static const ll MOD = 67280421310721;

namespace Kunitaka{
    template<
        typename TYPE,
        std::size_t SIZE
    >
    std::size_t array_length(const TYPE (&array)[SIZE])
    {
        return SIZE;
    }

    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
}
using namespace Kunitaka;
namespace Printer{
    void br(){
        cout << endl;
    }

    void loop_cnt(int i){
        cout << "i = " << i << endl;
    }

    void loop_cnt(int i, int j){
        cout << "i = " << i << ", " << "j = " << j << endl;
    }

    template<class T>
    void print(T x){
        cout << x << endl;
    }

    template<class T, class S>
    void print(T x, S y){
        cout << x << "," << y << endl;
    }

    template<class T, class S, class U>
    void print(T x, S y, U z){
        cout << x << "," << y << "," << z << endl;
    }

    template<class T, class S>
    void print(pair<T, S> p){
        cout << p.first << ", " << p.second << endl;
    }

    template<
        typename TYPE,
        std::size_t SIZE
    >
    void print(const TYPE (&array)[SIZE]){
        int lim = array_length(array);
        for(int i=0; i<lim; i++){
            if(i) cout << " ";
            cout << array[i];
        }
        cout << endl;
    }

    template<class S>
    void print(vector<S> v){
        for(int i=0; i<v.size(); i++){
            if(i) cout << " ";
            cout<< v[i];
        }
        cout << endl;
    }

    template<class S>
    void print(vector<vector<S> > vv){
        for(int i=0; i<vv.size(); i++){
            for(int j=0; j<vv[i].size(); j++){
                if(j) cout << " ";
                cout << vv[i][j];
            }
            cout << endl;
        }
    }

    void yesno(bool x){
        if(x) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
};
using namespace Printer;


ll binpow(ll a,ll x){
    ll res=1;
    while(x>0){
        if(x&1)
            res=(res*a);
        a=(a*a);
        x>>=1;
    }
    return res;
}

ll modInverse(ll a, ll m) 
{ 
    return(binpow(a, m-2)); 
} 
 
 // これで、nCkを求められる.
ll binomialCoeff(ll n, ll k)  
{  
    if(k > n) return 0;
    ll res = 1; 
    ll den=1; 
    ll inv;
    if ( k > n - k )  
        k = n - k;  
    for (ll i = 0; i < k; ++i)  
    {  
        res = (res*(n - i)); 
        inv=modInverse(i+1,1);
        res=(res*inv);
    }  
    return res;  
}

long combi(int n, int r) {
    if(r > n) return 0;
    if (r == 0) {
        return 1;
    }
    
    return (n - r + 1) * combi(n, r - 1) / r;
}

int main(int argc, const char * argv[]) {
    //提出時、消す----//
    //--------------//


    // input
    cout << fixed << setprecision(10);
    ll N; cin >> N;
    vector<ll> v(N);
    rep(i, N) cin >> v[i];
    ll d[MAX], res[MAX];
    memset(d, 0, sizeof(d));
    memset(res, 0, sizeof(res));
    rep(i, N){
        d[v[i]]++;
    }

    // rep(i, 10){
    //     print(d[i]);
    // }

    ll sum = 0;
    rep(i, MAX){
        res[i] = combi(d[i], 2);
        sum += res[i];
    }

    // print(sum);

    rep(i, N){
        ll ans = sum;
        ans -= res[v[i]];
        // print(res[v[i]]);
        // print(d[v[i]]);
        ll tmp = d[v[i]];
        // print(res[v[i]] / tmp * (tmp-2));
        ans += res[v[i]] * 2 / tmp * (tmp-2) / 2;
        cout <<ans << endl;
    }





    
    
    return 0;
}


Measured memory_bytes: 7296