





def    A_(			A				,      A   ):
	return x if y == 0 else greatest_common_divisor(SCREAMING_SNAKE_CASE_				,      x % y   )




def    A_(			A				,      A   ):
	return (x * y) // greatest_common_divisor(SCREAMING_SNAKE_CASE_				,      SCREAMING_SNAKE_CASE_   )




def    A_(			A = 20   ):
	UpperCAmelCase_								=     1
	for i in range(1				,      n + 1   ):
		UpperCAmelCase_								=     lcm(SCREAMING_SNAKE_CASE_				,      SCREAMING_SNAKE_CASE_   )
	return g


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









from torch import nn







class   _UpperCamelCase  (       nn.Module  ):







					'''simple docstring'''

					def __init__(						self    :  Dict ,					__lowercase    :  List[str] ,					__lowercase    :  Dict		):






						'''simple docstring'''







						super().__init__()
						UpperCAmelCase_								=     class_size
						UpperCAmelCase_								=     embed_size
						# self.mlp1 = nn.Linear(embed_size, embed_size)
						# self.mlp2 = (nn.Linear(embed_size, class_size))
						UpperCAmelCase_								=     nn.Linear(__lowercase ,					__lowercase		)





					def        SCREAMING_SNAKE_CASE							(						self    :  Any ,					__lowercase    :  Optional[Any]		):






						'''simple docstring'''







						UpperCAmelCase_								=     self.mlp(__lowercase		)
						return logits


