Submit solution

Points:
5

Time limit:
2.0s

Memory limit:
64M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

##### DWITE Online Computer Programming Contest, November 2007, Problem 1

In mathematics, a semiprime number is a natural number that is the product of exactly two prime numbers. For example: , , , , , , , are the first eight semiprime numbers. Given a set of numbers, one should be able to identify semiprime numbers contained in that set.

The input will contain five integers, one per line. .

The output will contain five lines, stating if the supplied integers were *"semiprime"* or *"not"*. Use the exact string output, all lower case, without quotes.

#### Sample Input

```
2
3
4
5
6
```

#### Sample Output

```
not
not
semiprime
not
semiprime
```

## Comments

This comment is hidden due to too much negative feedback. Click here to view it.

are the first eight semiprime numbers

Thanks