






def        lowerCamelCase__   (					__lowerCamelCase    :  list[int]	):
  # base case
  if len(__lowerCamelCase	) == 1:
    return a[0], a[0]
  else:
    # split A into half.
    __UpperCAmelCase							:			Tuple     =						a[: len(__lowerCamelCase	) // 2]
    __UpperCAmelCase							:			List[str]     =						a[len(__lowerCamelCase	) // 2 :]

    # 2 sub problems, 1/2 of original size.
    __UpperCAmelCase   ,				__UpperCAmelCase							:			int     =						max_difference(__lowerCamelCase	)
    __UpperCAmelCase   ,				__UpperCAmelCase							:			Dict     =						max_difference(__lowerCamelCase	)

    # get min of first and max of second
    # linear time
    __UpperCAmelCase							:			List[Any]     =						min(__lowerCamelCase	)
    __UpperCAmelCase							:			Optional[Any]     =						max(__lowerCamelCase	)

    # 3 cases, either (small1, big1),
    # (min_first, max_second), (small2, big2)
    # constant comparisons
    if biga - smalla > max_second - min_first and biga - smalla > biga - smalla:
      return smalla, biga
    elif biga - smalla > max_second - min_first:
      return smalla, biga
    else:
      return min_first, max_second


if __name__ == "__main__":
       import doctest

       doctest.testmod()










import decimal






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


if __name__ == "__main__":
       import doctest

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


