문제<\/h2>
Aaron, the mink, has two loves: biscuits and prime numbers. Growing up on our farm, he developed a special fondness for both. In the kitchen, he has cookie cutters shaped like the digits $0<\/mn><\/mrow>0<\/math><\/span><\/span> 0<\/span><\/span><\/span><\/span> through 9<\/mn><\/mrow>9<\/math><\/span><\/span> 9<\/span><\/span><\/span><\/span>. He fills them with dough, bakes the digits, and arranges them in a row on a tray to form a whole positive number.<\/p> Recently, Aaron managed to bake and arrange a prime number. After admiring it, he got hungry and ate one of the digit-biscuits. Without rearranging the remaining digits, he simply shifted them left or right to fill the gap. To his delight, the new number was still prime!<\/p> Now, Aaron is curious to see how many prime numbers he can find in a row through this process. Each time, he eats a digit, shifts the remaining ones, and checks if the new number is prime. If leading zeros appear after eating a digit, he happily eats those as well right away. However, if at any point the resulting number is not prime, the process ends immediately.<\/p> Today, Aaron baked a new set of digits and formed a new number, not necessarily prime. Aaron’s goal is to see the maximum number of prime numbers in a row, starting with the initial number and continuing for as long as possible.<\/p> Your task is to compute the maximum possible number of occurrences of prime numbers in this process.<\/p> 입력<\/h2> The input consists of a single line with integer N<\/mi><\/mrow>N<\/math><\/span><\/span> N<\/span><\/span><\/span><\/span> (1 ≤ N ≤ 10^9<\/span>), the number baked by Aaron.<\/p> 출력<\/h2> Output one integer specifying the maximum number of prime numbers that Aaron can see through his process.<\/p>$

Pray Mink