from common import sieve, permutation

primes = sieve(10000).primes()
primes2 = [ x for x in primes if x > 1000 ]
primes2.sort()

end = False
ignore = 1487
result = []

for p in primes2:
	for q in primes2:
		if p == q:
			continue
		if permutation(p, q):
			new = 0
			if q > p:
				diff = q - p
				new = q + diff
			else:
				diff = p - q
				new = p + diff

			if new in primes and permutation(q, new) and not permutation(ignore, p):
				result += [p, q, new]
				end = True
		if end:
			break
	if end:
		break

result.sort()
print str(result[0]) + str(result[1]) + str(result[2])