neprim

Task

You are given $n$ numbers. Find how many numbers are there in the array which are prime nonprime.

A prime nonprime number is a number such that all of its digits are prime, but the number is not prime.

Input data

The first line of the input file neprim.in contains $n$, the number of integers from the array. The next line contains $n$ positive integers which have at most $9$ digits.

Output data

The first line of the output file neprim.out contains a single integer, the number of prime nonprime numbers from the array.

Constraints and clarifications

• $1 \leq n \leq 1000$;
• $1 \leq v_i < 10^9$;

Example

neprim.in

6
34 23 130 325 777 120

neprim.out

2

Explanation

The two numbers which are prime nonprime in the array are $325$ (it is a multiple of $5$) and $777$ (it is a multiple of $111$).