Submit solution

Points:
3

Time limit:
2.0s

Memory limit:
64M

Authors:

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

Alphonse like primes.

His friend Beryl, however, has gotten fed up with Alphonse's antics. He decides that he will only be dealing with composite numbers in the future. Out of Alphonse's favorite positive integers, Beryl will take all those that are not prime and leave to go play Nintendogs. How many numbers will Beryl take?

#### Input Specification

On the first line, the number . On the next lines, a single positive integer .

#### Output Specification

The number of numbers that Beryl takes.

#### Sample Input 1

```
5
7
12
20
19
123
```

#### Sample Output 1

`3`

#### Sample Input 2

```
7
21
23
101
72
51
19
4
```

#### Sample Output 2

`4`

## Comments