NOVICE24  Problem 4
Given an integer N you have to find smallest prime number which comes after N, means smalltest prime which is greater than N.
Input
First line contains T the number of test cases. Each of next T lines contain one integer N. 1<=N<=10^9
Output
For each test case print the answer in a new line.
Example
Input: 2
5
21
Output: 7
23
hide comments
[Lakshman]:
20150108 14:41:40
There is some issue with the IO file My haskell code is giving NZEC but accepted for similar problem (8360. Prime After N AU12) 

John and the cows:
20130818 03:49:25
easy one :) 

Mahesh Chandra Sharma:
20110217 17:55:38
There was a problem in the "checker" option. It has been fixed now!


Knight:
20110217 17:50:59
Plz check the judge ...


Robert Gerbicz:
20110217 17:50:59
Is there input set for this problem? 

Mehul:
20110217 17:50:59
There seems to be some "waiting" problem in Judge 
Added by:  Mahesh Chandra Sharma 
Date:  20110126 
Time limit:  0.490s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM32GCC GAWK MAWK BC CCLANG CPP14 CPP14CLANG COBOL COFFEE DCLANG DDMD DART ELIXIR FANTOM FORTH GOSU GRV JSMONKEY KTLN NIM NODEJS OBJC OBJCCLANG OCT PICO PROLOG PYPY PY_NBC R RACKET RUST CHICKEN SED SQLITE SWIFT UNLAMBDA VB.NET 
Resource:  NSIT Noivce contest #2 