403022: GYM100971 C Triangles
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
C. Trianglestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output
There is a set of n segments with the lengths li. Find a segment with an integer length so that it could form a non-degenerate triangle with any two segments from the set, or tell that such segment doesn't exist.
InputThe first line contains a single integer n (2 ≤ n ≤ 200000) — the number of segments in the set.
The second line contains n integers li separated by spaces (1 ≤ li ≤ 109) — the lengths of the segments in the set.
OutputIf the required segment exists, in the first line output «YES» (without quotes). In this case in the second line output a single integer x — the length of the needed segment. If there are many such segments, output any of them.
If the required segment doesn't exist, output «NO» (without quotes).
ExamplesInput2Output
3 4
YESInput
2
3Output
3 4 8
YESInput
6
3Output
3 4 9
NO