beecrowd | 1165
# Prime Number

**Timelimit: 1**

Adapted by Neilor Tonin, URI Brazil

A Prime Number is a number that is divisible only by 1 (one) and by itself. For example the number 7 is Prime, because it can be divided only by 1 and by 7.

The input contains several test cases. The first contains the number of test cases **N ** (1 ≤ **N** ≤ 100). Each one of the following **N** lines contains an integer **X** (1 < **X** ≤ 10^{7}), that can be or not a prime number.

For each test case print the message “**X **eh primo” (**X **is prime) or “**X **nao eh primo” (**X** isn't prime) according with to above specification.

Input Sample | Output Sample |

3 |
8 nao eh primo |