#K40057. Maximum Possible n

    ID: 26557 Type: Default 1000ms 256MiB

Maximum Possible n

Maximum Possible n

You are given a list of integer results that are the outcomes of arithmetic operations performed on two unknown integers \(x\) and \(y\) such that \(0 \leq x, y \leq n\). The operations include addition, subtraction, multiplication, and floor division.

Your task is to determine the maximum possible value of \(n\) that could have produced these observed results.

Note: The maximum possible \(n\) is simply the maximum number in the given list of results.

inputFormat

The input is given in two lines. The first line contains a single integer \(N\) representing the number of results. The second line contains \(N\) space-separated integers which are the observed results.

outputFormat

Output a single integer: the maximum number among the given results.

## sample
1
1
1