Algorithm


A. Second Order Statistics
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Once Bob needed to find the second order statistics of a sequence of integer numbers. Lets choose each number from the sequence exactly once and sort them. The value on the second position is the second order statistics of the given sequence. In other words it is the smallest element strictly greater than the minimum. Help Bob solve this problem.

Input

The first input line contains integer n (1 ≤ n ≤ 100) — amount of numbers in the sequence. The second line contains n space-separated integer numbers — elements of the sequence. These numbers don't exceed 100 in absolute value.

Output

If the given sequence has the second order statistics, output this order statistics, otherwise output NO.

Examples
input
Copy
4
1 2 2 -4
output
Copy
1
input
Copy
5
1 2 3 1 1
output
Copy
2



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <stdio.h>
#include <algorithm>

using namespace std;

int const N = 101;
int n, a[N];

int main() {
	scanf("%d", &n);
	for(int i = 0; i < n; ++i)
		scanf("%d", a + i);

	sort(a, a + n);

	int mn = a[0], i = 0;
	while(a[i] == mn && i < n)
		++i;

	if(i == n && a[i - 1] == mn)
		puts("NO");
	else
		printf("%d\n", a[i]);

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
4
1 2 2 -4

Output

x
+
cmd
1
Advertisements

Demonstration


Codeforcess Solution Second Order Statistics ,A. Second Order Statistics C,C++, Java, Js and Python ,Second Order Statistics,Codeforcess Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+