


'''simple docstring'''






from __future__ import annotations

__A					:  Any											=      [True] * 100_0001
__A					:  Optional[int]											=      2
while i * i <= 100_0000:
  if seive[i]:
    for j in range(i * i, 100_0001, i):
      __A					:  Any											=      False
  i += 1







def 				UpperCamelCase_			(    A__					:   int					):
  '''simple docstring'''





  return seive[n]







def 				UpperCamelCase_			(    A__					:   int					):
  '''simple docstring'''





  return any(digit in """02468""" for digit in str(A__					)					)







def 				UpperCamelCase_			(    A__					:   int = 1_00_00_00					):
  '''simple docstring'''





  lowerCAmelCase_			:      Optional[int]			=   [2]  # result already includes the number 2.
  for num in range(3							,    limit + 1							,    2					):
    if is_prime(A__					) and not contains_an_even_digit(A__					):
      lowerCAmelCase_			:      Optional[int]			=   str(A__					)
      lowerCAmelCase_			:      Optional[int]			=   [int(str_num[j:] + str_num[:j]					) for j in range(len(A__					)					)]
      if all(is_prime(A__					) for i in list_nums					):
        result.append(A__					)
  return result







def 				UpperCamelCase_			(    ):
  '''simple docstring'''





  return len(find_circular_primes()					)


if __name__ == "__main__":
  print(F'''{len(find_circular_primes()) = }''')







'''simple docstring'''






def 				UpperCamelCase_			(    A__					:   int = 1_00					):
  '''simple docstring'''





  lowerCAmelCase_			:      int			=   set()

  lowerCAmelCase_			:      Tuple			=   0

  lowerCAmelCase_			:      str			=   n + 1  # maximum limit

  for a in range(2							,    A__					):
    for b in range(2							,    A__					):
      lowerCAmelCase_			:      str			=   a**b  # calculates the current power
      collect_powers.add(A__					)  # adds the result to the set
  return len(A__					)


if __name__ == "__main__":
  print("Number of terms ", solution(int(str(input()).strip())))



