Problem statement

There are $N$ different types of balls. There are $k_1$ balls of type 1, $k_2$ balls of type $2$, and so on to $k_n$. How many ways can you choose $2$ balls that are of different types?

Input format

The first line contains one positive integer N $(1 \leq N \leq 10^5)$ ...