package com.codegym.task.task05.task0532;
import java.io.*;
import java.util.*;
/*
Task about algorithms
*/
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
// Scanner sc= new Scanner(System.in);
int maximum =Integer.parseInt(reader.readLine()) ;
// int m=sc.nextInt();
int N[]=new int[maximum];
for(int i=0; i<maximum; i++){
N[i]=Integer.parseInt(reader.readLine());
//System.out.println(n[i]);
}
Arrays.sort(N);
// System.out.println(Arrays.toString(n));
System.out.println(N[maximum-1]);
}
//write your code here
}
/*
int[] n= new int[m];
// System.out.println(n);
for(int i=0; i<m; i++){
Arrays.sort(n);
// System.out.println(n);
}
*/
package com.codegym.task.task05.task0532;
import java.io.*;
import java.util.*;
/*
Task about algorithms
*/
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
// Scanner sc= new Scanner(System.in);
int maximum =Integer.parseInt(reader.readLine()) ;
// int m=sc.nextInt();
int N[]=new int[maximum];
for(int i=0; i<maximum; i++){
N[i]=Integer.parseInt(reader.readLine());
//System.out.println(n[i]);
}
Arrays.sort(N);
// System.out.println(Arrays.toString(n));
System.out.println(N[maximum-1]);
}
//write your code here
}
/*
int[] n= new int[m];
// System.out.println(n);
for(int i=0; i<m; i++){
Arrays.sort(n);
// System.out.println(n);
}
*/