#include <bits/stdc++.h>
using namespace std;
const int N = 1e5;
bool f[N+5];
int prime[N], cnt = 0;

int main() {
	
	f[0] = f[1] = 1;
	for (int i = 2; i*i <= N; i++) {
		if (f[i]) continue;
		for (int j = i*i; j <= N; j+=i)
			f[j] = 1;
	}
	for (int i = 2; i <= N; i++)
		if (!f[i])
			prime[cnt++] = i;
	
	return 0;
}