Problem Description

After Xiaoteng took a math class, he learned a lot of different shapes, but Xiaoteng's favorite triangle is because he likes stable shapes, just like his style.

After the Xiaoxun knew it, he wanted to give a triangle as a gift to Xiaoteng. He originally planned to do one, but he was too tired. So he decided to bring some wooden sticks to Xiaoteng and let Xiaoteng make a triangle himself.

One day, Xiaoxun brought $n$ sticks to Xiaoteng. Xiaoteng wanted to try to use three of them to form a triangle, but the number is too much, Xiaoteng stunned, so he can only ask for your help.

Input

There are mutiple test cases.

Each case starts with a line containing a integer $~n(1 \leq n \leq 5\times10^6)~$ which represent the number of sticks and this is followed by $n$ positive intergers(smaller than $2^{31}-1$) separated by spaces.

Output

YES or NO for each case mean Xiaoteng can or can't use three of sticks to form a triangle.

4
1 2 3 4

YES