#include <bits/stdc++.h>

using namespace std;

long largestValue(int  a[]) {
    /*max=a[0];int sum=0;
      for (int i=0;i<sizeof(a);i++)
      {if (max>a[i])
      {
          max=a[i]
      }}
    for (int i=0;i<sizeof(a);i++)
    {
        sum=max*a[i]
    }                     // Return the largest value of any of A's nonempty subarrays.
*/
                            return 0;}

int main() {
    int n;
    cin >> n;
    vector<int> A(n);
    for(int A_i = 0; A_i < n; A_i++){
       cin >> A[A_i];
    }
    long result = largestValue(A);
    cout << result << endl;
    return 0;
}