

import decimal
def 						UpperCamelCase_(			)       -> int:
 UpperCAmelCase__							=				0
 UpperCAmelCase__							=				decimal.Context(prec=1_05   )
 for i in range(2  ,    1_00   ):
  UpperCAmelCase__							=				decimal.Decimal(snake_case__   )
  UpperCAmelCase__							=				number.sqrt(snake_case__   )
  if len(str(snake_case__   )   ) > 1:
   answer += int(str(snake_case__   )[0]   )
   UpperCAmelCase__							=				str(snake_case__   )[2:1_01]
   answer += sum(int(snake_case__   ) for x in sqrt_number_str   )
 return answer


if __name__ == "__main__":
 import doctest

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






def 						UpperCamelCase_(			snake_case__:  list   )       -> list:
 UpperCAmelCase__							=				len(snake_case__   )

 # Set the gap value to be decreased by a factor of 1.3
 # after each iteration
 UpperCAmelCase__							=				1.3

 # Continue sorting until the gap is 1
 while gap > 1:
  # Decrease the gap value
  UpperCAmelCase__							=				int(gap / shrink   )

  # Sort the elements using insertion sort
  for i in range(snake_case__  ,    len(snake_case__   )   ):
   UpperCAmelCase__							=				collection[i]
   UpperCAmelCase__							=				i
   while j >= gap and collection[j - gap] > temp:
    UpperCAmelCase__							=				collection[j - gap]
    j -= gap
   UpperCAmelCase__							=				temp

 return collection


if __name__ == "__main__":
 import doctest

 doctest.testmod()



