Goldbach's Conjecture

Description

Fangjie is studying evolution of worms. Recently he putforward hypotheses that all worms evolve by division. There are n forms of worms. Worms of these forms have lengths a₁, a₂, ..., a_n. To prove his theory, professor needs to find 3 differentforms that the length of the first form is equal to sum of lengths of the othertwo forms. Help him to do this.

Input Description

There are multiple cases ended by EOF , The first line contains integer n (3 ≤ n ≤ 2000) — amount of worm´s forms. The second line contains n space-separated integers ai (1 ≤ ai ≤ 1000) — lengths of worms of each form.

Output Description

Each testcase if exits 3 distinct integers i j k (1 ≤ i, j, k ≤ n) — such indexes of worm´s forms that ai = aj + ak.output”Yes”, otherwise output”No”.

Sample Input

5
1 2 3 5 7
5
1 5 1 8 1

Sample Output

Yes
No
补选赛时做的。

典型的素数打表题。用个数组来存1000内素数。循环即可。