说明

Prime Numbers have great properties in many fields, and the unsolved Riemann conjecture in the world is also related to prime Numbers!Now, if I give you a number, can you tell if it's prime?

输入格式

Give you any set of data.

The data is guaranteed to be less than long long.

输出格式

OutputYesorNofor each set of data.

样例

2
6
19

Yes
No
Yes

样例

17
20

Yes
No

提示

小尾学长提醒:

使用while (~scanf("%lld",&n))或者while(scanf("%lld",&a)!=EOF)来读取每一次的输入。

试试以下例子

#include <stdio.h>

int main(){

    long long n;

    while(scanf("%lld",&a)!=EOF){ //输入就处理 直到结束输入，Windows结束输入用Ctrl+z 或者Ctrl+d然后回车结束输入。

    printf("%lld",n);

    }

    return 0;

}