package com.javarush.task.task05.task0532;
/*
Задача по алгоритмам
*/
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.sql.Array;
import java.util.ArrayList;
import java.util.Arrays;
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int maximum = Integer.MIN_VALUE;
while (true) {
String a = reader.readLine();
int n = Integer.parseInt(a);
if ((n > 0) && (n !=1)){
int[] list = new int[n];
for (int i = 0; i < n; i++) {
int m = Integer.parseInt(reader.readLine());
list[i] = m;
}
Arrays.sort(list);
maximum = list[list.length - 1];
System.out.println(maximum);}
else if (n==1){
maximum = Integer.parseInt(reader.readLine());
System.out.println(maximum);
}
else break;
}
}}