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
The Terminator: 2013-08-26 16:13:37

acc in little fermat
don't forget to use long long

Dragan MarkoviƦ: 2013-08-16 20:21:00

Fermat's primality test is awesome.

Lakshay Singhal: 2013-08-15 17:00:21

gr8 question...learnt smthng new
@hariprasath:ans for 9223372036854775783 is NO....

Bharath Reddy: 2013-06-17 09:13:33

1 iteration Miller Rabin enough..
Great question!!

Himanshu: 2013-06-02 16:16:02

really very good question learn a lot....
need 2 iterations of little fermit theorm.
thnaks to TOPCODER

Chandan Mittal: 2013-05-19 20:26:17

using MR test..
all my answers are correct
but still getting WA here :(

AC :) just had an integer overflow problem

Last edit: 2013-05-21 23:37:09
ওয়াসী (Wasi): 2013-05-04 12:34:57

AC at 1st submission with Miller_Rabin algo...:D
Nice problem!

Ouditchya Sinha: 2013-05-04 11:41:51

Nice problem, Learnt Non-deterministic primality testing algos. AC in 0.16s :)

mystique_blue: 2013-04-13 06:22:35

So far this is the problem that gave me most number of WA's, and also made me learn a number of amazing algos.

I like this category of problems.

Last edit: 2013-04-13 06:23:19

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