Given \textbf{N} integers. Required for each number to find the number of options to split the sum of two other numbers from the set. \InputFile The first line contains the number \textbf{N} (\textbf{1} ≤ \textbf{N} ≤ \textbf{10000}). Next, set \textbf{N} of natural numbers not exceeding \textbf{1000000000}. For each number of partitions is less than \textbf{2^31}. \OutputFile Print the \textbf{N} numbers (one per line) - the number of partitions in a manner consistent with the original.