





"""simple docstring"""
from math import ceil, sqrt



def      __lowerCamelCase   (							a_     :		int = 1_00_00_00							)			->      int:
      __SCREAMING_SNAKE_CASE   :Any						=  0

      for outer_width in range(3 ,   (limit // 4) + 2							):
            if outer_width**2 > limit:
                  __SCREAMING_SNAKE_CASE   :int						=  max(ceil(sqrt(outer_width**2 - limit							)							) ,   1							)
            else:
                  __SCREAMING_SNAKE_CASE   :Tuple						=  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() = }')






"""simple docstring"""
def      __lowerCamelCase   (							a_     :		Union[str, Any]							)			->      Optional[int]:
      __SCREAMING_SNAKE_CASE   :List[str]						=  1
      __SCREAMING_SNAKE_CASE   :Dict						=  2
      while i * i <= n:
            __SCREAMING_SNAKE_CASE   :Tuple						=  0
            while n % i == 0:
                  n //= i
                  multiplicity += 1
            n_divisors *= multiplicity + 1
            i += 1
      if n > 1:
            n_divisors *= 2
      return n_divisors



def      __lowerCamelCase   (							)			->      int:
      __SCREAMING_SNAKE_CASE   :Dict						=  1
      __SCREAMING_SNAKE_CASE   :Dict						=  1

      while True:
            i += 1
            t_num += i

            if count_divisors(a_							) > 5_00:
                  break

      return t_num


if __name__ == "__main__":
  print(solution())