"""simple docstring"""





def        a_  (   _lowerCAmelCase						:				int  ):





       '''simple docstring'''

       if bit_count < 0:
              raise ValueError('The given input must be positive'  )

       # get the generated string sequence
       lowercase__    :	Any     					=			gray_code_sequence_string(_lowerCAmelCase  )
       #
       # convert them to integers
       for i in range(len(_lowerCAmelCase  )  ):
              lowercase__    :	List[Any]     					=			int(sequence[i]     ,				2  )

       return sequence





def        a_  (   _lowerCAmelCase						:				int  ):





       '''simple docstring'''

       if bit_count == 0:
              return ["0"]

       if bit_count == 1:
              return ["0", "1"]

       lowercase__    :	List[str]     					=			1 << bit_count  # defines the length of the sequence
       # 1<< n is equivalent to 2^n

       # recursive answer will generate answer for n-1 bits
       lowercase__    :	List[str]     					=			gray_code_sequence_string(bit_count - 1  )

       lowercase__    :	Optional[int]     					=			[]

       # append 0 to first half of the smaller sequence generated
       for i in range(seq_len // 2  ):
              lowercase__    :	int     					=			'0' + smaller_sequence[i]
              sequence.append(_lowerCAmelCase  )

       # append 1 to second half ... start from the end of the list
       for i in reversed(range(seq_len // 2  )  ):
              lowercase__    :	List[str]     					=			'1' + smaller_sequence[i]
              sequence.append(_lowerCAmelCase  )

       return sequence


if __name__ == "__main__":
       import doctest

       doctest.testmod()
"""simple docstring"""





import math





def        a_  (   _lowerCAmelCase						:				int = 100  ):





       '''simple docstring'''

       lowercase__    :	Union[str, Any]     					=			sum(i * i for i in range(1     ,				n + 1  )  )
       lowercase__    :	str     					=			int(math.pow(sum(range(1     ,				n + 1  )  )     ,				2  )  )
       return square_of_sum - sum_of_squares


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

