def dec_to_bin(n):
	s = ''
	if n < 0: raise ValueError, "must be a positive integer"
	if n == 0: return '0'
	while n > 0:
		s = str(n % 2) + s
		n = n >> 1
	return s

def is_palindrome(s):
	forward  = [c for c in str(s)]
	backword = forward[:]
	backword.reverse()

	return forward == backword

s = 0
for i in range(0, 1000000):
	if is_palindrome(i) and is_palindrome(dec_to_bin(i)):
		s += i
		print i, dec_to_bin(i), s