import math
def reverseNumber(n) :
reverse = 0
while (n != 0):
reminder = n % 10
reverse = reverse * 10 + reminder
n = int(n / 10)
return reverse
def isPrime(n) :
if (n < 2 or (n % 2 == 0 and n != 2)) :
return false
count = int(math.floor(math.sqrt(n)))
for i in range(3, count, 2) :
if (n % i == 0) :
return False
return True
n = 79
reverse_n = reverseNumber(n)
if (isPrime(n) and isPrime(reverse_n)) :
print("Twisted prime number")
else :
print("Not twisted prime number")
'''
run:
Twisted prime number
'''