"""simple docstring"""






from copy import deepcopy
class        snake_case :




					"""simple docstring"""

					def __init__(       self     :			Dict					,lowerCamelCase__     :			list[int] | None = None					,lowerCamelCase__     :			int | None = None    ):

									if arr is None and size is not None:
													UpperCAmelCase__    =							size
													UpperCAmelCase__    =							[0] * size
									elif arr is not None:
													self.init(lowerCamelCase__    )
									else:
													raise ValueError('Either arr or size must be specified'    )







					def 	__lowerCAmelCase		(       self     :			Dict					,lowerCamelCase__     :			list[int]    ):
									UpperCAmelCase__    =							len(lowerCamelCase__    )
									UpperCAmelCase__    =							deepcopy(lowerCamelCase__    )
									for i in range(1					,self.size    ):
													UpperCAmelCase__    =							self.next_(lowerCamelCase__    )
													if j < self.size:
																	self.tree[j] += self.tree[i]







					def 	__lowerCAmelCase		(       self     :			Tuple    ):
									UpperCAmelCase__    =							self.tree[:]
									for i in range(self.size - 1					,0					,-1    ):
													UpperCAmelCase__    =							self.next_(lowerCamelCase__    )
													if j < self.size:
																	arr[j] -= arr[i]
									return arr







					@staticmethod
					def 	__lowerCAmelCase		(       lowerCamelCase__     :			int    ):
									return index + (index & (-index))







					@staticmethod
					def 	__lowerCAmelCase		(       lowerCamelCase__     :			int    ):
									return index - (index & (-index))







					def 	__lowerCAmelCase		(       self     :			str					,lowerCamelCase__     :			int					,lowerCamelCase__     :			int    ):
									if index == 0:
													self.tree[0] += value
													return
									while index < self.size:
													self.tree[index] += value
													UpperCAmelCase__    =							self.next_(lowerCamelCase__    )







					def 	__lowerCAmelCase		(       self     :			List[Any]					,lowerCamelCase__     :			int					,lowerCamelCase__     :			int    ):
									self.add(lowerCamelCase__					,value - self.get(lowerCamelCase__    )    )







					def 	__lowerCAmelCase		(       self     :			Optional[Any]					,lowerCamelCase__     :			int    ):
									if right == 0:
													return 0
									UpperCAmelCase__    =							self.tree[0]
									right -= 1  # make right inclusive
									while right > 0:
													result += self.tree[right]
													UpperCAmelCase__    =							self.prev(lowerCamelCase__    )
									return result







					def 	__lowerCAmelCase		(       self     :			List[Any]					,lowerCamelCase__     :			int					,lowerCamelCase__     :			int    ):
									return self.prefix(lowerCamelCase__    ) - self.prefix(lowerCamelCase__    )







					def 	__lowerCAmelCase		(       self     :			List[str]					,lowerCamelCase__     :			int    ):
									return self.query(lowerCamelCase__					,index + 1    )







					def 	__lowerCAmelCase		(       self     :			List[str]					,lowerCamelCase__     :			int    ):
									value -= self.tree[0]
									if value < 0:
													return -1

									UpperCAmelCase__    =							1  # Largest power of 2 <= size
									while j * 2 < self.size:
													j *= 2

									UpperCAmelCase__    =							0

									while j > 0:
													if i + j < self.size and self.tree[i + j] <= value:
																	value -= self.tree[i + j]
																	i += j
													j //= 2
									return i


if __name__ == "__main__":
						import doctest

						doctest.testmod()




"""simple docstring"""






def 						a_		(      lowerCamelCase      ,    lowerCamelCase ):
				return x if y == 0 else greatest_common_divisor(lowerCamelCase      ,    x % y )



def 						a_		(      lowerCamelCase      ,    lowerCamelCase ):
				return (x * y) // greatest_common_divisor(lowerCamelCase      ,    lowerCamelCase )



def 						a_		(      lowerCamelCase = 2_0 ):
				UpperCAmelCase__    =							1
				for i in range(1      ,    n + 1 ):
								UpperCAmelCase__    =							lcm(lowerCamelCase      ,    lowerCamelCase )
				return g


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



