import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] array = new int[n];
if (n > 0) {
for (int s = 0; s < array.length; s++) {
array[s] = in.nextInt();
}
int min = array[0];
for (int i = 0; i < array.length; i++) {
if (min > array[i]) {
min = array[i];
}
}
System.out.println(min);
}
}
}
package com.javarush.task.pro.task05.task0506;
import java.util.Scanner;
/*
Reverse
*/
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] array = new int[n];
if (n > 0) {
for (int s = 0; s < array.length; s++) {
array[s] = in.nextInt();
}
int min = array[0];
for (int i = 0; i < array.length; i++) {
if (min > array[i]) {
min = array[i];
}
}
System.out.println(min);
}
}
}