#!/usr/bin/env python

import math						# An example of module.

def prime(val):						# prime() function returns:						
	val=abs(val)					# 0 -> number is prime;
	if val == 0 | val == 1:				# 1 -> number isn't prime.
		return 1
	elif val != 2:
		if val%2 == 0:
			return 1
		else:
			lim=int(math.sqrt(val)+1)	# The '.' operator is used
			for div in xrange(3,lim,2):	# to call the functions
				if val%div == 0:	# from the modules.
					return 1
	return 0

primes=[]
for odd in xrange(3,6000,2):
	if prime(odd) == 0:
		primes.append(odd)
primes.sort()
for odd in xrange(5,6000,2):
	found=0
	for prm in primes:
		if prm <= odd:
			lim=int(math.sqrt((odd-prm)/2))+1
			for n in xrange(lim):
				if odd == prm+2*n*n:
					found=1
					break
		if found == 1:
			break
	if found == 0:
		print "\n\t", odd, "\n"
		break