#include <iostream>
using namespace std;
//pow a^b
int pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1) {
res *= a;
}
a *= a;
b >>= 1;
}
return res;
}
//check number is prime
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;
}
//get number of digits in a number
int getDigits(int num)
{
int digits = 0;
while (num != 0)
{
num /= 10;
digits++;
}
return digits;
}
//get n from user
// print all numbers from 1 to 10^n that getDigits of number is n and number is prime
int main(){
int n;
cout << "Enter n: ";
cin >> n;
int num = 1;
while (getDigits(num) != n)
{
num++;
}
while (num <= pow(10, n))
{
if (isPrime(num))
{
cout << num << endl;
}
num++;
}
return 0;
}