CF1189B Number Circle（数字圈）

You are given nn numbers a1,a2,…,ana1,a2,…,an. Is it possible to arrange them in a circle in such a way that every number is strictly less than the sum of its neighbors?

给定了n个数，a1...an。是否存在一种排列方式使得每个数比与他相邻的两个数的和小？

For example, for the array [1,4,5,6,7,8][1,4,5,6,7,8], the arrangement on the left is valid, while arrangement on the right is not, as 5≥4+15≥4+1 and 8>1+68>1+6.

比如说，对于这个数列，左侧排列是可以的，右侧排列是不行的

Input

The first line contains a single integer nn (3≤n≤1053≤n≤105) — the number of numbers.

第一行包含一个整数n——数字的个数

The second line contains nn integers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109) — the numbers. The given numbers are not necessarily distinct (i.e. duplicates are allowed).

第二行