Fermat's Easy Problem

Description

In number theory, Pierre de Fermat's theorem on sums of two squares states that an odd prime p .Fermat usually did not prove his claims and he did not provide a proof of this statement. The first proof was found by Euler after much effort and is based on infinite descent. He announced it in a letter to Goldbach on April 12, 1749. Give you a number n,if n is a prime and n mod 4 =1,output "Yes" else "No"

Input

Input a number n.(Multiple case)

Output

"Yes" or "No"

Sample Input

23571113

Sample Output

NoNoYesNoNoYes

 

 

代码