





UpperCamelCase__     =	"Tobias Carryer"

from time import time

class     __SCREAMING_SNAKE_CASE   :






							def __init__(  self					,	__lowerCAmelCase					,	__lowerCAmelCase					,	__lowerCAmelCase					,	__lowerCAmelCase=int(time()					)					):  # noqa: B008
														UpperCamelCase__			       =     multiplier
														UpperCamelCase__			       =     increment
														UpperCamelCase__			       =     modulo
														UpperCamelCase__			       =     seed







							def 			_lowerCamelCase						(  self					):
														UpperCamelCase__			       =     (self.multiplier * self.seed + self.increment) % self.modulo
														return self.seed


if __name__ == "__main__":
					# Show the LCG in action.
					UpperCamelCase__     =	LinearCongruentialGenerator(1_664_525, 1_013_904_223, 2 << 31)
					while True:
										print(lcg.next_number())









def       _UpperCamelCase       (a__				:str    ):






							"""simple docstring"""





							UpperCamelCase__			       =     0

							# if input_string is "aba" than new_input_string become "a|b|a"
							UpperCamelCase__			       =     """"""
							UpperCamelCase__			       =     """"""

							# append each character + "|" in new_string for range(0, length-1)
							for i in input_string[: len(a__    ) - 1]:
														new_input_string += i + "|"
							# append last character
							new_input_string += input_string[-1]

							# we will store the starting and ending of previous furthest ending palindromic
							# substring
							UpperCamelCase__       ,       UpperCamelCase__			       =     0, 0

							# length[i] shows the length of palindromic substring with center i
							UpperCamelCase__			       =     [1 for i in range(len(a__    )    )]

							# for each character in new_string find corresponding palindromic string
							UpperCamelCase__			       =     0
							for j in range(len(a__    )    ):
														UpperCamelCase__			       =     1 if j > r else min(length[l + r - j] // 2				,     r - j + 1    )
														while (
														    j - k >= 0
														    and j + k < len(a__    )
														    and new_input_string[k + j] == new_input_string[j - k]
														):
																					k += 1

														UpperCamelCase__			       =     2 * k - 1

														# does this string is ending after the previously explored end (that is r) ?
														# if yes the update the new r to the last index of this
														if j + k - 1 > r:
																					UpperCamelCase__			       =     j - k + 1  # noqa: E741
																					UpperCamelCase__			       =     j + k - 1

														# update max_length and start position
														if max_length < length[j]:
																					UpperCamelCase__			       =     length[j]
																					UpperCamelCase__			       =     j

    # create that string
							UpperCamelCase__			       =     new_input_string[start - max_length // 2 : start + max_length // 2 + 1]
							for i in s:
														if i != "|":
																					output_string += i

							return output_string


if __name__ == "__main__":
					import doctest

					doctest.testmod()




