CodeForces - 766B Mahmoud and a Triangle

Mahmoud has n line segments, the i-th of them has length a_i. Ehab challenged him to use exactly 3 line segments to form a non-degenerate triangle. Mahmoud doesn't accept challenges unless he is sure he can win, so he asked you to tell him if he should accept the challenge. Given the lengths of the line segments, check if he can choose exactly 3 of them to form a non-degenerate triangle.

Mahmoud should use exactly 3 line segments, he can't concatenate two line segments or change any length. A non-degenerate triangle is a triangle with positive area.

Input

The first line contains single integer n (3 ≤ n ≤ 10⁵) — the number of line segments Mahmoud has.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹) — the lengths of line segments Mahmoud has.

Output

In the only line print "YES" if he can choose exactly three line segments and form a non-degenerate triangle with them, and "NO" otherwise.

Example

Input

5
1 5 3 2 4

Output

YES

Input

3
4 1 2

Output

NO

Note

For the first example, he can use line segments with lengths 2, 4 and 5 to form a non-degenerate triangle.

题目大意：给你一串数，让你判断从里面挑三个，能否组成一个有正面积的三角形，如果能就输出YES，否则就输出NO

题目分析：本来想着数据是不是有点大，用三层循环会超时，后来发现是自己傻了，直接排个序从小到大，然后因为三角形的判定规则是两边之和大于第三边，所以我们可以找到abc按顺序大小排列，因为ab要尽可能的大，c要尽可能的小，所以他们相邻，然后一层循环解决。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 100005;
long long a[maxn];
int main(){
	int n;
	while((scanf("%d",&n))!=EOF){
		for(int i=0;i<n;i++)
		   scanf("%I64d",&a[i]);
	    sort(a,a+n);
	    int flag=0;
	    for(int i=0;i<n-2;i++){
	    	if(a[i]+a[i+1]>a[i+2]){
	    		printf("YES\n"),
	    		flag=1;
	    		break;
			}
		}
		if(flag==0)
          printf("NO\n");
	}
	return 0;
}