I tried it with different "N" numbers, and it works perfectly.
thanks
package com.codegym.task.task05.task0532;
import java.io.*;
/*
Task about algorithms
*/
public class Solution {
public static void main(String[] args) throws Exception {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int maximum= 0;
int temporal = 0;
int N = Integer.parseInt(reader.readLine());
if (N<=0)
return;
for (int i=0; i<N; i++ ){
int current = Integer.parseInt(reader.readLine());
if (current > maximum){
maximum = current;
}
}
// int a =
/*
int a = Integer.parseInt(reader.readLine());
int a = Integer.parseInt(reader.readLine());
int a = Integer.parseInt(reader.readLine());
int a = Integer.parseInt(reader.readLine());
*/
System.out.println(maximum);
}
}