소수 찾기

#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <cmath>
using namespace std;



int main() {
	//freopen("input.txt", "rt", stdin);
	int n;
	cin >> n;
	int cnt = 0;
	for (int i = 0; i < n; i++) {
		int num;
		cin >> num;
		if (num == 1) {
			continue;
		}
		int flag = 0;
		for (int j = 2; j <num; j++) {
			if (num % j == 0) {
				flag = 1;
				break;
			}
		}
		if (flag == 0) {
			cnt++;
		}
	}
	printf("%d", cnt);
	


	return 0;
}