#include <bits/stdc++.h> #define ll long long using namespace std; ll n,l,r; bool f; ll piu(ll x) { if(x<2) return 0; for(ll i=2;i*i<=x;i++) if(x%i0) return 0; return 1; } ll prime(ll l,ll r) { for(ll i=l;i<=r;i++) { f=0; ll p=i; if(!piu(p)) continue; while(p) { p/=10; if(!piu(p)&&p) {f=1;break;} } if(!f) cout<<i<<"\n"; } } int main() { // freopen("prime.in","r",stdin); // freopen("prime.out","w",stdout); cin>>n; if(n1) cout<<"2\n3\n5\n7\n"; else if(n2) prime(10,99); else if(n3) prime(100,999); else if(n4) prime(1000,9999); else if(n5) prime(10000,99999); else if(n6) cout<<"233993\n239933\n293999\n373379\n373393\n593933\n593993\n719333\n739391\n739393\n739397\n739399"; else if(n7) cout<<"2339933\n2399333\n2939999\n3733799\n5939333\n7393913\n7393931\n7393933"; else if(n==8) cout<<"23399339\n29399999\n37337999\n59393339\n73939133"; return 0; }