/ *
     Find if a number is circular prime or not.
*/

class CircularPrime
{   
    boolean isPrime(int m)
    {
        int c=0;
        for(int i=1; i0)
        {
            n=n/10;
            c++;
        }
        return c;
    }

    void main(int num)
    {
        int n=num;
        int c=countDigits(num);
        int f=0; int t=0;
        int p=1;
        for(int i=1; i