High in the frost-covered peaks of the Glacial Algorithm Range, the Order of the Frozen Function guards the Iceforge — a forge where powerful programs are hammered into existence. Apprentice Bjorn has been tasked with crafting a solution to the Bit Bender trial called "Maximum of N Numbers — Level 7" before the winter solstice. The forges burn bright, and the air is thick with the smell of molten silicon. The Grand Smith watches Bjorn closely, ready to judge whether his code can withstand the cold of the mountains. Read n then n space-separated integers and print the maximum. The Iceforge manual lays out these hard constraints, for the forge tolerates no inefficiency: 1 <= n <= 1000, -10^9 <= values <= 10^9 On the workbench, Bjorn finds these sample ingots to test his hammer against: Input: 4 1 3 2 9 Output: 9 Outside the forge, the blizzard howls. The solstice bell will ring soon, and Bjorn must present his finished program or be sent back to the valleys. Forge a solution that is both elegant and robust. The Order expects nothing less than perfection. The path to mastering Maximum of N Numbers — Level 7 is not one that can be walked in a single step. It demands patience, precision, and a deep respect for the boundaries that shape the problem. Many adventurers before you have attempted this trial and failed, their code crashing against the very constraints that the elders inscribed. But you have the tools. You have the training. You have reached the Bit Bender tier, and that alone means the council believes in your potential. Look once more at the examples above. Trace the logic with your finger if you must. Consider the time and memory limits carefully, for they are not suggestions but strict laws of the arena. When you are ready, commit your solution. Let the compiler run. Let the test cases judge your work. If your code is true, the gates will open and you will move closer to the ultimate rank. If not, study the failure, sharpen your algorithm, and try again. For in the halls of CodeTikki, the only thing more important than success is the wisdom gained from the attempt. Remember that the Bit Bender challenge is designed to test not just knowledge, but character. Every edge case is a lesson. Every time limit is a teacher. Every hidden test is a guardian at the gate. Do not rush. Let your code breathe. Let it be as clean as a mountain stream. When the final test passes, you will know that you have earned the title. Until then, code with courage, test with care, and never stop learning.
Constraints:
1 <= n <= 1000, -10^9 <= values <= 10^9
