#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 <= N; i++) {
		if (!f[i]) prime[cnt++] = i;
		for (int j = 0; j < cnt && prime[j] * i <= N; j++) {
			f[prime[j] * i] = 1;
			if (i % prime[j] == 0) break;
		}
	}
	
	return 0;
}