#include<iostream>
#include<algorithm>
using namespace std;
long long a[3];
int gcd(long long a, long long b) {
	if (b % a == 0)return a;
	b %= a;
	gcd(b, a);
}
int main() {
	long long now2;
	for (int i = 0; i < 3; i++)
		cin >> a[i];
	sort(a, a + 3);
	long long now =(a[0]*a[1])/ gcd(a[0], a[1]);
	if (now <= a[2])
		 now2 = (now * a[2]) / gcd(now, a[2]);
	else
		now2 = (now * a[2]) / gcd(a[2], now);
	cout << now2;
}