import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv,
    std.functional, std.math, std.numeric, std.range, std.stdio, std.string,
    std.random, std.typecons, std.container;

ulong MAX = 1_000_100, MOD = 1_000_000_007, INF = 1_000_000_000_000;
alias sread = () => readln.chomp();
alias lread(T = long) = () => readln.chomp.to!(T);
alias aryread(T = long) = () => readln.split.to!(T[]);
alias Clue = Tuple!(long, "x", long, "y", long, "h");
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);

long cnt;

void main()
{
    auto n = lread();
    auto a = aryread();
    auto box = new long[](n + 1);
    foreach(e; a)
        box[e]++;
    long s;
    foreach (e; box)
    {
        if(e > 1)
        {
            s += e * (e - 1) / 2;
        }
    }
    foreach(i; iota(n))
    {
        writeln(s - (box[a[i]] - 1));
    }
}

bool is_reverse(string s)
{
    bool ret = true;
    foreach(i; iota(s.length))
    {
        ret &= (s[i] == s[$ - 1 - i]);
    }
    return ret;
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}
