2018-BNUZ-ACM-GDCPC选拔赛（耻辱赛）E 【补题】

B. Mahmoud and a Triangle

time limit per test

 2 seconds

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

Mahmoud has n line segments, the i-th of them has length ai. 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 ≤ 105) — the number of line segments Mahmoud has.

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109) — 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.

Examples

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.

输入一大堆边，是否能组合出三角形

先用sort排序（比较快），然后直接比较相邻的三条边就行（因为已经进行过排序了）。

#include <bits/stdc++.h>

using namespace std;



int judge(int a,int b,int c) {
	if (a + b > c && c - a < b){
		return 1;
	}
	return 0;
}

int a[100005];

int main () {
	int t;
	cin >> t;
	int d;
	int flag = 0;
	memset(a,0,sizeof(a));
	for(int i = 0; i < t; i++) {
		cin >> a[i];
	}
	sort(a,a+t);
//	for(int i = 1;i <= t;i++){
//		cout << a[i] <<endl;
//	}
	for(int i = 1; i < t - 1; i++) {
		if(judge(a[i - 1],a[i],a[i + 1])) {
			flag = 1;
			break;
		}
	}


	if(flag) {
		cout << "YES" << endl;
	} else {
		cout << "NO" << endl;
	}
	return 0;
}

/*
int judge(int a,int b,int c) {
	if (a + b > c && c - a < b){
		return 1;
	}
	return 0;
}


有意思的三角判断条件 
*/