public void palindrome(int num)
    {
        int given=num;
        int cpy=given;
        int size=0;
        while(given>10){
            size++;
            given=given/10;
        }
        int[] arr=new int[size+1];
        for (int i=0; i<size+1; i++)
        {
            arr[i] = cpy%10;
            cpy = cpy/10;
        }
        int pivot=(size+1)/2;
        boolean ifPal=true;
        for(int i=0;i<pivot;i++){
            if(arr[i]==arr[size-i])
                ifPal=true;
            else
                ifPal=false;
        }
        if(ifPal==true)
            System.out.println(num);
    }
    public boolean prime(int n){
        int num=n;
        if(num<2)
        return false;

    for(int i=2;i*i<=num;i++){
        if(num%i==0){
//                    System.out.println("not prime");
                    return false;
                }

        }
//        System.out.println("prime");
    return true;
    }