






def 	lowerCamelCase   (		a_ = 100      )      ->     Optional[int]:
							lowerCAmelCase_									=	0
							lowerCAmelCase_									=	0
							for i in range(1					,		n + 1      ):
														sum_of_squares += i**2
														sum_of_ints += i
							return sum_of_ints**2 - sum_of_squares


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








def 		a__      (		_UpperCamelCase      :			int			,_UpperCamelCase      :			int				):
   while second != 0:
      __lowerCamelCase    				=     first & second
      first ^= second
      __lowerCamelCase    				=     c << 1
   return first


if __name__ == "__main__":
  import doctest

  doctest.testmod()

  a_								=       int(input("""Enter the first number: """).strip())
  a_								=       int(input("""Enter the second number: """).strip())
  print(f"{add(first, second) = }")






