





import decimal





def lowerCAmelCase__()    ->				str:







	'''simple docstring'''







	lowerCamelCase__        =		0
	lowerCamelCase__        =		decimal.Context(prec=105							)
	for i in range(2	,100							):
		lowerCamelCase__        =		decimal.Decimal(__snake_case							)
		lowerCamelCase__        =		number.sqrt(__snake_case							)
		if len(str(__snake_case							)							) > 1:
			answer += int(str(__snake_case							)[0]							)
			lowerCamelCase__        =		str(__snake_case							)[2:101]
			answer += sum(int(__snake_case							) for x in sqrt_number_str							)
	return answer


if __name__ == "__main__":
			import doctest

			doctest.testmod()
			print(f"""{solution() = }""")










from __future__ import annotations

import math
import random





def lowerCAmelCase__(__snake_case	,__snake_case	,__snake_case							)    ->				list[int]:







	'''simple docstring'''







	lowerCamelCase__        =		d * e - 1
	lowerCamelCase__        =		0
	lowerCamelCase__        =		0
	while p == 0:
		lowerCamelCase__        =		random.randint(2	,n - 1							)
		lowerCamelCase__        =		k
		while True:
			if t % 2 == 0:
				lowerCamelCase__        =		t // 2
				lowerCamelCase__        =		(g**t) % n
				lowerCamelCase__        =		math.gcd(x - 1	,__snake_case							)
				if x > 1 and y > 1:
					lowerCamelCase__        =		y
					lowerCamelCase__        =		n // y
					break  # find the correct factors
			else:
				break  # t is not divisible by 2, break and choose another g
	return sorted([p, q]							)


if __name__ == "__main__":
			import doctest

			doctest.testmod()



