from math import ceil, sqrt





def 				UpperCAmelCase						(    lowercase = 1000000							):







				"""simple docstring"""



				__lowercase 			=							0

				for outer_width in range(3							,			(limit // 4) + 2							):
								if outer_width**2 > limit:
												__lowercase 			=							max(ceil(sqrt(outer_width**2 - limit							)							)							,			1							)
								else:
												__lowercase 			=							1
								if (outer_width - hole_width_lower_bound) % 2:
												hole_width_lower_bound += 1

								answer += (outer_width - hole_width_lower_bound - 2) // 2 + 1

				return answer


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





def 		__A		(	__lowerCamelCase    )      ->       int:
	a										=							0
	while num > 0:
		digit_sum += num % 10
		num //= 10
	return digit_sum





def 		__A		(	__lowerCamelCase = 100    )      ->       int:
	a										=							1
	a										=							2

	for i in range(2							,			max_n + 1    ):
		a										=							pre_numerator
		a										=							2 * i // 3 if i % 3 == 0 else 1
		a										=							cur_numerator
		a										=							e_cont * pre_numerator + temp

	return sum_digits(__lowerCamelCase    )


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

