package java1;

import java.util.Arrays;

public class emirps {
    public static void main(String args[]) {
        int count = 0;
        int[] initialarr = new int[301];
        initialarr = primes();
        int[] finalarr = new int[100];
        finalarr = reversal(initialarr);
        for(int i = 0; i < 100; i++) {
            //System.out.println("\r" + finalarr[i] + " ");
            System.out.printf("%d ",finalarr[i]);
            count++;
            if (i%10 == 0 && i != 0) {
                System.out.println();
            }
        }
        //System.out.println("initial " + Arrays.toString(initialarr));
    }


    public static int[] primes() {
        int primes = 0;
        int prime = 2;
        int[] retprimes = new int[301];

        while (primes < 300) {

            if (isPrime(prime)) {
                primes ++;
                retprimes[primes] = prime;
            }
            prime++;
        }
        return retprimes;
    }

    public static int[] reversal(int[] primes) {
        int[] reversal = new int[301];
        int count = 0;
        for (int i = 0; count < 100; i++) {
            if (primes[i] > 11) {

                if (isPrime(reverseInteger(primes[i])) && (reverseInteger(primes[i]) != primes[i])) {
                    reversal[count] = primes[i];
                    count++;
                }

            }
        }

        //System.out.println("reversal "+ Integer.toString(count) +Arrays.toString(reversal));

        return reversal;
    }



    private static boolean isPrime(int possprime) {
        if (possprime < 2) {
            return false;
        }
        if (possprime == 2) {
            return true;
        }
        if (possprime % 2 == 0) {
            return false;
        }
        for (int i = 3; i * i <= possprime; i += 2)
            if (possprime % i == 0) {
                return false;
            }
        return true;
    }

    public static int reverseInteger(int number) {
        boolean isNegative = number < 0 ? true : false;
        if(isNegative){
            number = number * -1;
        }
        int reverse = 0;
        int lastDigit = 0;

        while (number >= 1) {
            lastDigit = number % 10; // gives you last digit
            reverse = reverse * 10 + lastDigit;
            number = number / 10; // get rid of last digit
        }

        return isNegative == true? reverse*-1 : reverse;
    }


}