Find the count of prime numbers in the array.

Difficulty: Hard

Phase: 4 · Basic Arrays

XP Reward: 30 XP

Topics: Basic Arrays, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given N followed by N integers, count how many prime numbers exist in the array. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 5 2 3 4 5 6

Output: 3

Explanation: Sample execution for input 5 2 3 4 5 6