#include<bits/stdc++.h>
using namespace std;
bool isprime(int n) {
	if (n == 1)
		return false;
	for (int i = 2; i * i <= n; i++) {
		if (n % i == 0)
			return false;
	}
	return true;
}
int main() {
	int n;
	cin >> n;
	int min_num = pow(10, n - 1);
	int max_num = pow(10, n) - 1;
	for (int i = min_num; i <= max_num; i++) {
		if (isprime(i)) {
			for (int j = 1; j <= n; j++) {
				if (!isprime(i / (min_num / pow(10, j - 1))))
					goto ccc;
			}
			cout << i << endl;
		}
ccc:
		i = i;
	}
}