def is_lychrel(n):
for _ in range(50):
n += reverse_number(n)
if is_palindrome(n):
return False
return True
def solve():
palindromes = list()
for i in reversed(range(100, 1000)):
for j in reversed(range(100, 1000)):
if is_palindrome(i * j):
palindromes.append(i * j)
return max(palindromes)
