


def   _lowercase(					__a				:						str     ):
							a__      =[0 for i in range(len(__a     )     )]

							# initialize interval's left pointer and right pointer
							a__    ,     a__      =0, 0

							for i in range(1    ,     len(__a     )     ):
														# case when current index is inside the interval
														if i <= right_pointer:
																					a__      =min(right_pointer - i + 1    ,     z_result[i - left_pointer]     )
																					a__      =min_edge

														while go_next(__a    ,     __a    ,     __a     ):
																					z_result[i] += 1

														# if new index's result gives us more right interval,
														# we've to update left_pointer and right_pointer
														if i + z_result[i] - 1 > right_pointer:
																					a__    ,     a__      =i, i + z_result[i] - 1

							return z_result






def   _lowercase(					__a				:						int    ,     __a				:						list[int]    ,     __a				:						str     ):
							return i + z_result[i] < len(__a     ) and s[z_result[i]] == s[i + z_result[i]]






def   _lowercase(					__a				:						str    ,     __a				:						str     ):
							a__      =0
							# concatenate 'pattern' and 'input_str' and call z_function
							# with concatenated string
							a__      =z_function(pattern + input_str     )

							for val in z_result:
														# if value is greater then length of the pattern string
														# that means this index is starting position of substring
														# which is equal to pattern string
														if val >= len(__a     ):
																					answer += 1

							return answer


if __name__ == "__main__":
	import doctest

	doctest.testmod()





'''simple docstring'''






def    _snake_case  (	A					,       A			)		->       int:
							return x if y == 0 else greatest_common_divisor(A					,       x % y			)


def    _snake_case  (	A					,       A			)		->       int:
							return (x * y) // greatest_common_divisor(A					,       A			)


def    _snake_case  (	A = 20			)		->       int:
							lowerCAmelCase__			  =      1
							for i in range(1					,       n + 1			):
														lowerCAmelCase__			  =      lcm(A					,       A			)
							return g


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