Distinct Colors

There are $N$ different types of colours numbered from $1$ to $N$. Chef has $A_i$ balls having colour $i$, $(1\le i \le N)$. Chef will arrange some boxes and put each ball in **exactly one** of those boxes. Find the **minimum** number of boxes Chef needs so that **no** box contains **two** balls of same colour. ### Input - The first line of input will contain a single integer $T$, denoting the