// Program 50: Circular Prime Number

import java.util.*;
class CircularPrime
{
    static boolean prime(int n)
    {
        if (n < 2)
        {
            return false;
        }
        for (int i = 2; i * i <= n; i++)
        {
            if (n % i == 0)
            {
                return false;
            }
        }
        return true;
    }
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter a number: ");
        int n = sc.nextInt(), t = n, digits = 0, place = 1;
        while (t > 0) { digits++;
            t /= 10;
        }
        for (int i = 1; i < digits; i++)
        {
            place *= 10;
        }
        int rot = n;
        boolean circular = true;
        for (int i = 0; i < digits; i++)
        {
            if (!prime(rot))
            {
                circular = false;
            }
            rot = (rot % 10) * place + rot / 10;
        }
        if (circular)
        {
            System.out.println("Circular prime");
        }
        else
        {
            System.out.println("Not a circular prime");
        }
    }
}