import math
def isPandigital(n):
    n = str(n)
    for x in range(0,len(n)):
        if n.count(n[x]) > 1 or n.count("0") != 0:
            return False
        else: continue
    return True
def isPrime(n):
    for x in range(2,int(math.sqrt(n))):
        if n%x == 0: return False
    return True
def nextPrime(n):
    n-=1
    while isPrime(n) == False:
        n-=1
    return n
    
x = 7654320
while(x > 2):
    if isPandigital(x):
        print("Answer is:",x)
        break
    x = nextPrime(x)
    print(x)