public class MyClass {
static int reverseNumber(int n) {
int reverse = 0, reminder;
while (n != 0) {
reminder = n % 10;
reverse = reverse * 10 + reminder;
n = n / 10;
}
return reverse;
}
static boolean isPrime(int n) {
if (n < 2 || (n % 2 == 0 && n != 2)) {
return false;
}
int count = (int)Math.floor(Math.sqrt(n));
for (int i = 3; i <= count; i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
public static void main(String args[]) {
int n = 79;
int reverse_n = reverseNumber(n);
if (isPrime(n) && isPrime(reverse_n)) {
System.out.println("Twisted prime number");
} else {
System.out.println("Not twisted prime number");
}
}
}
/*
run:
Twisted prime number
*/
