import java.util.Scanner;
public class TwistedPrimeInGivenArray
{
    /* reverseOfNumber() reverses a number */
    public static int reverseOfNumber(int num)
    {
        int temp=0,reversedInteger=0,remainder=0;
        temp=num;
        while( temp > 0 )
        {
            remainder = temp % 10;
            reversedInteger = reversedInteger * 10 + remainder;
            temp /= 10;
        }
        return reversedInteger;
    }

    /* isPrime() checks whether a number is prime number or not */
    public static boolean isPrime(int num)
    {
        boolean flag = true;

        if(num>1)
        {
            for (int j = 2; j <= num / 2; j++)
            {
                if ((num % j) == 0)
                {
                    flag = false;
                    break;
                }
            }
        }
        else
        {
            flag=false;
        }

        return flag;
    }

    public static void main(String[] args)
    {

        int reversedNumber=0,size=0;
        int arr[];
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter size of Array:");
        size = sc.nextInt();
        arr=new int[size];
        System.out.println("Enter elements in Array:");
        for(int i=0;i<size;i++)
        {
            arr[i] = sc.nextInt();
        }
        System.out.println("Twisted Prime numbers in given array:");
        for(int i=0;i<size;i++)
        {
            if (isPrime(arr[i])==true)
            {
                reversedNumber=reverseOfNumber(arr[i]);
                if(isPrime(reversedNumber)==true)
                {
                    System.out.print(arr[i]+" ");
                }
            }

        }

    }
}