#描述#
After superman managed to solve the problem whether several sticks can form a triangle, now he thinks of a more advanced problem whether some sticks can form an equilateral triangle (None of them can be bended).

#格式#
##输入格式##
Given an integer n (3&lt=n&lt=30), which means the total number of sticks (Number 0 indicates the end of input). And n integers followed by mean the different length of such sticks(1&lt=len[i]&lt=100).

##输出格式##
If such sticks can form an equilateral triangle (All of them should be used), please print “Yes”, or print the word “No”.

#样例1#
##样例输入1##

3 100 100 100 
4 10 10 10 20
0

##样例输出1##

Yes
No

#限制#
1000ms
32768KB

#提示#
It is not guaranteed that given sticks can form a triangle, saying nothing of an equilateral triangle.

#来源#