#include <iostream>
#include <vector>
usingnamespace std;
int isPrime (int a, vector c)
{
for (int b = 0; b < c.size(); b++)
{
if (a % c[b] == 0) return 0;
}
return a;
}
int main()
{
vector <int>v;
for (int i = 2; i < 100; i++)
if (isPrime(i, v) == i)
{
cout << i << endl;
v.push_back(i);
}
cout << v.size();
return 0;
}