



def 	_lowerCAmelCase						(				__lowerCamelCase   :     int     ):



 """simple docstring"""





 __SCREAMING_SNAKE_CASE       :    Optional[int]       =	0
 while num > 0:
  digit_sum += num % 10
  num //= 10
 return digit_sum






def 	_lowerCAmelCase						(				__lowerCamelCase   :     int = 100     ):



 """simple docstring"""





 __SCREAMING_SNAKE_CASE       :    Dict       =	1
 __SCREAMING_SNAKE_CASE       :    str       =	2

 for i in range(2		,	max_n + 1     ):
  __SCREAMING_SNAKE_CASE       :    Any       =	pre_numerator
  __SCREAMING_SNAKE_CASE       :    List[str]       =	2 * i // 3 if i % 3 == 0 else 1
  __SCREAMING_SNAKE_CASE       :    Optional[Any]       =	cur_numerator
  __SCREAMING_SNAKE_CASE       :    int       =	e_cont * pre_numerator + temp

 return sum_digits(__lowerCamelCase     )


if __name__ == "__main__":
      print(f'''{solution() = }''')











from math import sqrt






def 	_lowerCAmelCase						(				__lowerCamelCase   :     int     ):



 """simple docstring"""





 if 1 < number < 4:
  # 2 and 3 are primes
  return True
 elif number < 2 or number % 2 == 0 or number % 3 == 0:
  # Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
  return False

 # All primes number are in format of 6k +/- 1
 for i in range(5		,	int(sqrt(__lowerCamelCase     ) + 1     )		,	6     ):
  if number % i == 0 or number % (i + 2) == 0:
   return False
 return True






def 	_lowerCAmelCase						(				__lowerCamelCase   :     int = 10001     ):



 """simple docstring"""





 __SCREAMING_SNAKE_CASE       :    List[Any]       =	0
 __SCREAMING_SNAKE_CASE       :    Dict       =	1
 while count != nth and number < 3:
  number += 1
  if is_prime(__lowerCamelCase     ):
   count += 1
 while count != nth:
  number += 2
  if is_prime(__lowerCamelCase     ):
   count += 1
 return number


if __name__ == "__main__":
      print(f'''{solution() = }''')






