package com.javarush.task.task05.task0532;
import java.io.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
import java.io.Reader;
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int N;
String n = reader.readLine();
N = Integer.parseInt(n);
int maximum = Integer.MIN_VALUE;
if ( N > 0) {
for (int i = 1; i <= N; i++) {
String InCount = reader.readLine();
int count = Integer.parseInt(InCount);
if (count > maximum)
{
maximum = count;
}
}
if (maximum > 0) System.out.println(maximum);
}
}
}
package com.javarush.task.task05.task0532;
/*
Задача по алгоритмам
*/
import java.io.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
import java.io.Reader;
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
//напишите тут ваш код
int N;
String n = reader.readLine();
N = Integer.parseInt(n);
int maximum = Integer.MIN_VALUE;
if ( N > 0) {
for (int i = 1; i <= N; i++) {
String InCount = reader.readLine();
int count = Integer.parseInt(InCount);
if (count > maximum)
{
maximum = count;
}
}
if (maximum > 0) System.out.println(maximum);
}
}
}