def ispalindrome(s):
	if (len(s)>0) and (s == s[::-1]):
		return 1
	else:
		return 0


def answer(n):
	q=n
	t=0
	b=1
	while(t!=1):
		b+=1
		n_b=[]
		while (int(q/b)!=0):
			n_b.append(q%b)
			q=int(q/b)
		n_b.append(q%b)
		s="".join([str(n_b[i]) for i in range(0,len(n_b))])
		t=ispalindrome(s)
		q=n
	return b

for n in range(1,100):
	print(answer(n))