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
californiagurl: 2014-02-22 05:17:05

i'm getting TLE on a 21sec time limit question....facepalm.

Martijn Muijsers: 2014-01-12 19:52:36

SIGPFE, sure. :P

hiddenman: 2013-12-29 17:35:09

gr8 question.....
Both algo works....perfectly... :)

Satyam Kumar Shivam: 2013-12-29 11:55:35

phewww finally green light :D ... even 1 iteration of fermat test worked for me.. :D ...
And 9223372036854775783 is the largest 63 bit prime.so, ans will be YES.

Tarun Garg: 2013-12-27 16:05:42

@Roamn Sal dont know y but i used Miller rabin with 2 iteration and used long long unsigned everywhere still showing WA...could you pls check my submission...

Saimadhav Heblikar: 2013-11-25 12:14:27

weak test cases..

knb_dtu: 2013-11-23 15:12:16

Miller Rabin

Wei Qiu: 2013-11-06 23:02:24

Hi,all
how do you get around the int overflow problem.
In my algorithm ,when I calculate the modular exponentiation, I need to calculate 2^63 * 2^63 which leads to int overflow.
EDIT: ok, i get it, I should also do the multiplication in a similar way.

Last edit: 2013-11-06 23:15:54
AlcatraZ: 2013-10-23 20:52:39

Nice problem.. Learned something new.

Last edit: 2013-10-30 00:06:54
P_Quantum: 2013-09-22 17:16:30

Nice one..!! Learned a lot..:)


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