"""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() = }''')


"""simple docstring"""





def        a_  (   _lowerCAmelCase						:				str  ):





       '''simple docstring'''

       lowercase__    :	Any     					=			[0] * len(_lowerCAmelCase  )

       for i in range(1     ,				len(_lowerCAmelCase  )  ):
              # use last results for better performance - dynamic programming
              lowercase__    :	List[str]     					=			prefix_result[i - 1]
              while j > 0 and input_string[i] != input_string[j]:
                     lowercase__    :	Dict     					=			prefix_result[j - 1]

              if input_string[i] == input_string[j]:
                     j += 1
              lowercase__    :	Union[str, Any]     					=			j

       return prefix_result





def        a_  (   _lowerCAmelCase						:				str  ):





       '''simple docstring'''

       return max(prefix_function(_lowerCAmelCase  )  )


if __name__ == "__main__":
       import doctest

       doctest.testmod()

