#include <iostream>
using namespace std;
 
int main() {
	// your code goes here
	int prime[101];
	for(int i=0;i<101;i++)
		prime[i]=1;//As we dont know if a number is prime we assume that all numbers are prime and then we will mark all non primes
	prime[0]=0;
	prime[1]=0;
	//0 and 1 are not prime
	for(int i=2;i<11;i++)
		for(int j=2*i;j<101;j+=i)
			prime[j]=0;//Marking all multiples of i as not prime
	for(int i=2;i<101;i++)
		if(prime[i]==1)
			cout<<i<<endl;
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglpbnQgcHJpbWVbMTAxXTsKCWZvcihpbnQgaT0wO2k8MTAxO2krKykKCQlwcmltZVtpXT0xOy8vQXMgd2UgZG9udCBrbm93IGlmIGEgbnVtYmVyIGlzIHByaW1lIHdlIGFzc3VtZSB0aGF0IGFsbCBudW1iZXJzIGFyZSBwcmltZSBhbmQgdGhlbiB3ZSB3aWxsIG1hcmsgYWxsIG5vbiBwcmltZXMKCXByaW1lWzBdPTA7CglwcmltZVsxXT0wOwoJLy8wIGFuZCAxIGFyZSBub3QgcHJpbWUKCWZvcihpbnQgaT0yO2k8MTE7aSsrKQoJCWZvcihpbnQgaj0yKmk7ajwxMDE7ais9aSkKCQkJcHJpbWVbal09MDsvL01hcmtpbmcgYWxsIG11bHRpcGxlcyBvZiBpIGFzIG5vdCBwcmltZQoJZm9yKGludCBpPTI7aTwxMDE7aSsrKQoJCWlmKHByaW1lW2ldPT0xKQoJCQljb3V0PDxpPDxlbmRsOwoJcmV0dXJuIDA7Cn0=