




from math import ceil







def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						int = 1001				)  ->							int:
    UpperCAmelCase_										=					1

    for i in range(1	,					int(ceil(n / 2.0				)				)				):
        UpperCAmelCase_										=					2 * i + 1
        UpperCAmelCase_										=					2 * i
        UpperCAmelCase_										=					total + 4 * odd**2 - 6 * even

    return total


if __name__ == "__main__":
 import sys

 if len(sys.argv) == 1:
  print(solution())
 else:
  try:
   _lowerCamelCase      			=						int(sys.argv[1])
   print(solution(n))
  except ValueError:
   print('Invalid entry - please enter a number')











def  SCREAMING_SNAKE_CASE     (	__UpperCamelCase      :						Dict=2_8123				)  ->							str:
    UpperCAmelCase_										=					[1] * (limit + 1)

    for i in range(2	,					int(limit**0.5				) + 1				):
        sum_divs[i * i] += i
        for k in range(i + 1	,					limit // i + 1				):
            sum_divs[k * i] += k + i

    UpperCAmelCase_										=					set()
    UpperCAmelCase_										=					0

    for n in range(1	,					limit + 1				):
        if sum_divs[n] > n:
            abundants.add(__UpperCamelCase				)

        if not any((n - a in abundants) for a in abundants				):
            res += n

    return res


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





