UVa 897

#include<bits/stdc++.h>
using namespace std;

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")

typedef unsigned long long ull;
typedef long long          ll;
typedef long double        lld;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef pair<ll,ll >       pll;
typedef vector< pii >      vpii;
typedef vector< pll >      vpll;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scii(n,m)          scanf("%d %d",&n,&m)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define spc                printf(" ")
#define line               printf("\n")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define vout(v)            for(int w=0;w<v.size();w++){if(w) cout<<' '; cout<<v[w];}
#define clr(a,x)           memset(a,x,sizeof(a))
#define tp(v,j)            get<j>(v)
#define pb                 push_back
#define mp                 make_pair
#define mt                 make_tuple
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
#define fastIO()           ios_base::sync_with_stdio(false); cin.tie(NULL);
/// Constants
#define eps                1e-6
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                1e9
#define MAXn               10000009

int GCD(int a, int b) { return b == 0 ? a : GCD(b , a % b); }
ll LCM(ll a, ll b) { return a * (b/GCD(a, b)); }

vi prime;
bitset<MAXn>chk;


void seive()
{
    chk[0]=chk[1]=1;
    for(int i=4;i<MAXn;i+=2) chk[i]=1;
    for(int i=3;i<=MAXn/i;i+=2){
        if(chk[i]) continue;
        for(int j=i*i;j<MAXn;j+=(2*i)) chk[j]=1;
    }
    prime.pb(2);
    for(int i=3;i<MAXn;i+=2){
        if(!chk[i]) prime.pb(i);
    }
}

int BSup(int lo,int hi,int n)
{
    if(lo>hi) return MAX;
    int mid = (lo+hi)/2;
    if(prime[mid]>n) return min(mid, BSup(lo,mid-1,n));
    return BSup(mid+1,hi,n);
}

int BSlo(int lo,int hi,int c)
{
    if(lo>hi) return -1;
    int mid = (lo+hi)/2;
    if(prime[mid]<c) return max(mid, BSlo(mid+1,hi,c));
    return BSlo(lo,mid-1,c);
}

bool angprime(int x)
{
    vi v;
    while(x){
        v.pb(x%10);
        x/=10;
    }
    sort(all(v));
    do{
        x=0;
        for(int i=0;i<v.size();i++){
            x=x*10+v[i];
        }
        if(chk[x]) return false;
    }while(next_permutation(all(v)));
    return true;
}

int main()
{
    #ifdef VAMP
        clock_t tStart = clock();
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    seive();

    while(1){
        int n;
        sci(n);
        if(!n) break;
        int c=1;
        while(c<=n) c*=10;
        int st = BSup(0,prime.size()-1,n);
        int en = BSlo(0,prime.size()-1,c);
        bool f=true;
        for(int i=st;i<=en;i++){
            if(angprime(prime[i])){
                pfi(prime[i]);line;
                f=false;
                break;
            }
        }
        if(f) pf("0\n");
    }


    #ifdef VAMP
        fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif

    return 0;
}