#!/usr/bin/python
# vim: fileencoding=utf-8
from math import sqrt
from itertools import ifilter, count
 
def sieve():
	g = count(2)
	while True:
		prime = g.next()
		yield prime
		g = ifilter(lambda x, prime=prime: x%prime, g)
 
def is_prime(n):
	limit = int(sqrt(n))
	for i in range(limit, 1, -1):
		if n % i == 0:
			return False
	else:
		return True
 
limit = 1709023
for prime in sieve():
	if prime > limit:
		print "Error"
		break
	else:
		q, r = divmod(limit, prime)
		if r == 0 and is_prime(q):
			print "The key is %i and %i" % (prime, q)
			break