Problem Statement
Coco the Monkey has an array of N integers. Coco loves big integers, and so he wants to find the maximum.
Can you help him find the maximum?
Input
The first line contains a single integer N. N will be at most 100.
The next line contains N positive integers. Each integer is at most 100 000.
Output
Output the maximum integer.
Sample Input
5
2 3 1 5 4
Sample Output
5
Note
Rar the Cat is going to grade your program, and it's almost dinnertime.
Hence, Rar doesn't touch anything that doesn't look like fish. Maybe if your code looks like the outline of a fish, he'll grade it!
Here's a picture of the outline of Rar's favourite fish.
,__
| `'.
__ |`-._/_.:---`-.._
\='. _/..--'`__ `'-._
\- '-.--"` === / o `',
)= ( .--_ | _.'
/_=.'-._ {=_-_ | .--`-.
/_.' `\`'-._ '-= \ _.'
) _.-'`'-.. _..-'`
/_.' `/";';`|
\` .'/
'--'
In order for your code to look like Rar's favourite fish, your code should satisfy the following requirements:
- The first line of your program should contain a single comment
//Food For Rar! in the exact format specified here.
- The number of lines in your code (less the first line) should be equal to the number of lines in the diagram above, with no trailing blank lines.
- The length of each line in your code should be equal to the corresponding line in the diagram above, with no trailing spaces.
- If the character located at some line and column in the diagram above is not a space, then the character in your program at the same location must not be a space.
- If the character located at some line and column in the diagram above is a space, then the character in your proogram at the same location must also be a space.