Score : 300 points
Snuke has N hats. The i-th hat has an integer a_i written on it.
There are N camels standing in a circle. Snuke will put one of his hats on each of these camels.
If there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes
; otherwise, print No
.
Input is given from Standard Input in the following format:
N a_1 a_2 \ldots a_{N}
Print the answer.
3 1 2 3
Yes
Yes
.4 1 2 4 8
No
No
.