A **Circular Prime** is a prime number that remains prime under cyclic shifts of its digits. When the leftmost digit is removed and replaced at the end of the remaining string of digits, the generated number is still prime. The process is repeated until the original number is reached again.

A number is said to be prime if it has only two factors 1 and itself.

**Example:**

131

311

113

Hence, 131 is a circular prime.

Accept a positive number N and check whether it is a circular prime or not. The new numbers formed after the shifting of the digits should also be displayed.

Test your program with the following data and some random data:

**Example 1:****INPUT:**

N = 197**OUTPUT:**

197

971

719

197 IS A CIRCULAR PRIME.

**Example 2:****INPUT:**

N = 1193**OUTPUT:**

1193

1931

9311

3119

1193 IS A CIRCULAR PRIME.

**Example 3:****INPUT:**

N = 29**OUTPUT:**

29

92

29 IS NOT A CIRCULAR PRIME.

```
import java.io.*;
class CircularPrime{
public static void main(String args[])
throws IOException{
InputStreamReader in = new InputStreamReader(System.in);
BufferedReader br = new BufferedReader(in);
System.out.print("N = ");
int n = Integer.parseInt(br.readLine());
String s = Integer.toString(n);
int len = s.length();
boolean status = true;
for(int i = 1; i <= len; i++){
if(!isPrime(n))
status = false;
System.out.println(n);
s = s.substring(1) + s.charAt(0);
n = Integer.parseInt(s);
}
if(status)
System.out.println(n + " IS A CIRCULAR PRIME.");
else
System.out.println(n + " IS NOT A CIRCULAR PRIME.");
}
public static boolean isPrime(int num){
int f = 0;
for(int i = 1; i <= num; i++)
if(num % i == 0)
f++;
return (f == 2);
}
}
```

Can scanner class file operations be written in examinations

Yes

Can I use scanner class for the file program named marks.txt in the percentage mark program

No. Using Scanner class for file operations is not in syllabus.