[1978] 소수 찾기

#include <iostream>
#include <vector>
using namespace std;
int main()
{
	vector<int> v;
	int n, cnt = 0;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		int num;
		cin >> num;
		v.push_back(num);
	}
		
	for (int i = 0; i < n; i++)
	{
		int suso = 0;
		if (v[i] > 1)
		{
			for (int j = 1; j <= v[i]; j++)
			{
				if (v[i] % j == 0)
				{
					suso++;
				}
			}
		}
		if( suso == 2)
			cnt++;
	}
	cout << cnt;
	return 0;
}