import Control.Monad
import qualified Data.Set as S
solve n a = take n $ scanl step r a
  where 
    ss@(s:_) = scanr S.insert S.empty a
    r = sum $ zipWith S.findIndex a ss
    step r x = r + (n-1) - S.findIndex x s * 2
main = do
  n <- readLn
  a <- replicateM n readLn :: IO [Integer]
  mapM_ print $ solve n a