Problem 1

Verification of circular prime number (Id-1051)

​

Question:         

       A circular prime number is a prime number 'p' with a property that all the numbers got by cyclically permuting the digits of 'p', are also a prime number.

       A number is said to be a prime if it has no factors other than the number 1 and itself. 19937 is a circular prime number, as all the numbers obtained by cyclically permuting the number 19937 : 99371, 93719,37199,71993,19937 are all prime.

       Develop an algorithm and write a C program to check if the given number is circular prime or not.

​

Input Format:

A number

​

Output Format:

Print Circular prime or Not circular prime

​

​

OUTPUT