跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2679. Second Order Statistics

  • ID: 2685
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 枚举
  • 算法思想
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Second Order Statistics

题目描述

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
4
1 2 2 -4
Output
1
Input
5
1 2 3 1 1
Output
2

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2343 题。保留原作者与原赛事署名。