The Beauty of the Most Beautiful Subarray

Given an array A of n integers, your task is to determine the beauty of the most beautiful subarray. The beauty of a subarray is defined as the maximum element present in it. Since every subarray contains at least one element, the beauty of the most beautiful subarray is simply the maximum element of the entire array.

Formally, if \(A = [a_1, a_2, \dots, a_n]\), then the answer is \[ \max_{1 \leq i \leq n} a_i \] Output this value as a floating-point number with exactly nine digits after the decimal point.

inputFormat

The first line contains an integer (n), the number of elements in the array. The second line contains (n) space-separated integers representing the array elements.

outputFormat

Output the beauty of the most beautiful subarray as a floating-point number with exactly nine digits after the decimal point.## sample

1
5

5.000000000