def is_prime(num):
"""判断一个数是否为素数"""
if num < 2:
return False
for i in range(2, int(num**0.5) + 1):
if num % i == 0:
return False
return True

def is_palindrome(num):
"""判断一个数是否为回文数"""
return str(num) == str(num)[::-1]

def reverse_number(num):
"""返回一个整数的逆序数"""
return int(str(num)[::-1])

def find_emirps(n):
"""输出小于n的所有反素数"""
emirps = []
for i in range(2, n):
if not is_palindrome(i) and is_prime(i) and is_prime(reverse_number(i)):
emirps.append(i)
return emirps