public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(reader.readLine());
if (n==0||n<0){
System.exit(0);
}else if(n>0&&n!=1){
int ini=Integer.parseInt(reader.readLine());
int max=ini;
for (int i=1;i<n;i++){
int j=Integer.parseInt(reader.readLine());
max=max>=j?max:j;
}
System.out.println(max);
}else if (n==1){
int ini=Integer.parseInt(reader.readLine());
System.out.println(ini);
}
//在此编写你的代码
// System.out.println(maximum);
}
}
package zh.codegym.task.task05.task0532;
import java.io.*;
/*
有关算法的任务
*/
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt(reader.readLine());
if (n==0||n<0){
System.exit(0);
}else if(n>0&&n!=1){
int ini=Integer.parseInt(reader.readLine());
int max=ini;
for (int i=1;i<n;i++){
int j=Integer.parseInt(reader.readLine());
max=max>=j?max:j;
}
System.out.println(max);
}else if (n==1){
int ini=Integer.parseInt(reader.readLine());
System.out.println(ini);
}
//在此编写你的代码
// System.out.println(maximum);
}
}