





"""simple docstring"""
import math



def 					__lowerCamelCase       (							a_					:		int = 1_00							)      ->				int:
      __SCREAMING_SNAKE_CASE       :List[Any]		    =  sum(i * i for i in range(1			,       n + 1							)							)
      __SCREAMING_SNAKE_CASE       :int		    =  int(math.pow(sum(range(1			,       n + 1							)							)			,       2							)							)
      return square_of_sum - sum_of_squares


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






"""simple docstring"""
def 					__lowerCamelCase       (							a_					:		str			,       a_					:		str							)      ->				str:
      __SCREAMING_SNAKE_CASE       :int		    =  len(a_							)
      __SCREAMING_SNAKE_CASE       :int		    =  len(a_							)
      __SCREAMING_SNAKE_CASE       :int		    =  (
          first_str_length if first_str_length > second_str_length else second_str_length
      )
      __SCREAMING_SNAKE_CASE       :list		    =  []
      for char_count in range(a_							):
            if char_count < first_str_length:
                  output_list.append(first_str[char_count]							)
            if char_count < second_str_length:
                  output_list.append(second_str[char_count]							)
      return "".join(a_							)


if __name__ == "__main__":
  print(alternative_string_arrange("AB", "XYZ"), end=" ")