PON - Prime or Not


Given the number, you are to answer the question: "Is it prime?"

Solutions to this problem can be submitted in C, C++, Pascal, Perl, Python, Ruby, Lisp, Hask, Ocaml, Prolog, Whitespace, Brainf**k and Intercal only.

Input

t – the number of test cases, then t test cases follows. [t <= 500]
Each line contains one integer: N [2 <= N <= 2^63-1]

Output

For each test case output string "YES" if given number is prime and "NO" otherwise.

Example

Input:
5
2
3
4
5
6

Output:
YES
YES
NO
YES
NO

hide comments
cake_is_a_lie: 2017-02-22 01:11:21

@rishi_devan: We do have a deterministic primality test; google AKS primality test.

Note that I did get AC with Rabin-Miller however; it's just a matter of using enough rounds; and you can use deterministic witnesses to ensure consistent results.

Last edit: 2017-02-22 01:32:00
malavan: 2017-01-10 15:58:03

Why wrong answer in Miller :(

scorpion_ajay: 2017-01-07 14:24:36

good question, ac in one go, 20 iterations is a good choice for almost all integers
please tell me, why sieve did not worked here
ac in a go :)

swatantragupta: 2016-12-23 12:38:13

nice question...miller rabin works fine ..take care of overflow while multiplication..

Abhishek: 2016-09-24 18:33:02

Solved with 4 iterations of fermat's

mkfeuhrer: 2016-07-07 10:05:30

miller rabin accptd! prime sieve algo dint work....! yes multiplication wd mod is obvious.!

pulkitgulati: 2016-07-03 01:25:31

miller rabin is working fine...wa with fermat.

harshit23897: 2016-06-30 18:31:28

I am getting WA in both fermat and miller

mostasim: 2016-05-18 17:08:33

why i'm getting runtime error with prime sieve algo :(

ov3rk1ll: 2016-03-24 10:43:47

take care of integer overflow


Added by:Roman Sol
Date:2005-01-24
Time limit:21s
Source limit:5000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ADA95 ASM32 BASH CSHARP CLPS D ERL FORTRAN ICON JAVA JS-RHINO LUA NEM NICE PHP PIKE ST
Resource:ZCon 2005