#include <bits/stdc++.h>
#include <math.h>

using namespace std;

string increment(string n) {
    for (int i=n.size()-1; i>=0; i--) {
        n[i]++;
        if (n[i]=="3") {
            n[i] = "0";
        } else {
            break;
        }
    }
    return n;
}

bool isPrime(long long n) {
    if( n <= 1 )
        return false;
    long long half = n / 2;
    for( long long i = 2; i <= half; i++ )
        if( isPrime(i) && n % i == 0 )
            return false;
    return true;
}

int main() {
    vector<long long> primes {2, 3, 5, 7};
    vector<long long> firstdigit {3, 5, 7};
    string p = "1";
    long long number = 3;

    while (number<1000000000000000) {
        if (isPrime(number)) {
            cout << number << endl;
        }

        p = increment(p);
        if (p[p.size()-1] == "0") {
            p = increment(p);
        }
        number = 0;
        for (int i = 0; i<p.size(); i++) {
            number+=(primes[int(p.substr(i,1))]*pow(10, p.size()-i-1);
        }
    }

    return 0;
}