def gcd(n,m):
    if (n%m)*(m%n)==0:
        return min(n,m)
    else:
        return gcd(min(n,m),max(n,m)%min(n,m))
n1,n2=map(int,input().split())
print(int(n1*n2/gcd(n1,n2)))