As we all know, Clarence loves playing cookie clicker!
One day, a magical white rabbit Benson came to Clarence with N games of cookie clicker, each of which played by one of his NUS December Course students and has Ai cookies
Clarence is under pressuer! He has a dinner(cookie eating) date with Yue Chen and does not have much time. He needs to select the game with the most cookies
The first line of input will contain 1 integer, N < 10^12
The next N lines of input will contain 1 integer Ai < 100
There will be one line of output, the maximum number of cookies Clarence can get