{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE TypeFamilies #-}
import           Data.Maybe
import           Data.Int
import           Data.List
import           Data.Char
  -- import qualified Data.Vector.Unboxing as VU
import qualified Data.Vector as V
import qualified Data.Vector.Mutable as VM
import qualified Data.Vector.Unboxed as VU
import qualified Data.Vector.Unboxed.Mutable as VUM
import qualified Data.ByteString.Char8 as BS
import           Data.List (scanl')
import           Data.IORef
import           Control.Monad
import           Control.Monad.ST
import           Control.Monad.State.Strict
import           Control.Applicative
import           Debug.Trace
import           Text.Printf


readInt = BS.readInt . BS.dropWhile isSpace
getVector f = VU.unfoldr f <$> BS.getLine
getIntVector = getVector readInt
getBSVector = getVector BS.uncons

main = do
  n <- readLn :: IO Int
  as <- map read . words <$> getLine :: IO [Int]

  -- ansPrint n as
  modelAnswer n as

solve k as = solver as
  where
    as' = delete k as


comb x y = (loop1 x y 1) `div` (loop2 y 1)
  where
    loop1 _ 0 n' = n'
    loop1 n r n' = loop1 (n-1) (r-1) (n*n')
    loop2 0 n' = n'
    loop2 n n' = loop2 (n-1) (n*n')

comb' x = if x <= 0 then 0 else comb x 2


solver as = foldl' (\n m -> (+) n $ comb' . length $ m ) 0 $ group as

dpaNumber :: Int -> [Int] -> VU.Vector Int
dpaNumber n as = VU.create $ do
  dp <- VUM.replicate (n+1) 0

  forM_ as $ \a -> do
    VUM.modify dp (\n -> n+1) a

  return dp

ansPrint n as = do
  let as' = VU.fromList $ 0:as
      aNumber = dpaNumber n as
      aComb = VU.map comb' aNumber
      aCombExclude = VU.map (\n -> (comb' $ n-1)) aNumber

  forM_ [1..n] $ \i -> do
    let k = as' VU.! i
        aExclude = aCombExclude VU.! k
        ans = (\(n,m) -> aExclude + VU.sum n + (VU.sum $ VU.tail m))  $ VU.splitAt k aComb
    print ans

modelAnswer n as = do
  let aNumber = dpaNumber n as
      aSumCombination = VU.foldl' (\n m -> n + (comb' m)) 0 $ aNumber


  forM_ as $ \a -> do
    let aNum = aNumber VU.! a
    print $ aSumCombination - ((comb' aNum) - (comb' $ aNum-1))
