#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
std::vector<int> vs[] = {
	{1, 2, 3},
	{1, 3, 2},
	{2, 1, 3},
	{2, 3, 1},
	{3, 1, 2},
	{3, 2, 1},
};
std::multiset<int> f(std::vector<int> v) {
	std::multiset<int> s;
	for(int x : v) s.emplace(std::abs(x));
	return s;
}

int A, B, C;
int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> A >> B >> C;
	ll ans = 0;
	for(auto x : vs) {
		for(int j = 0;j < 8;++j) {
			auto t = x;
			for(int k = 0;k < 3;++k) if(j >> k & 1) t[k] *= -1;
			auto aa = t; sort(aa.begin(), aa.end());
			do {
				for(int l = 0;l < 8;++l) {
					auto a = aa;
					for(int k = 0;k < 3;++k) if(l >> k & 1) a[k] *= -1;
					auto z = t;
					for(int j = 0;j < 3;++j) {
						z[j] -= a[j];
					}
					if(f(t) == f(a) && f(t) == f(z)) {
						int min = 1e7;
						min = std::min(min, A / std::abs(t[0]));
						min = std::min(min, A / std::abs(a[0]));
						min = std::min(min, B / std::abs(t[1]));
						min = std::min(min, B / std::abs(a[1]));
						min = std::min(min, C / std::abs(t[2]));
						min = std::min(min, C / std::abs(a[2]));
						ans += min;
					}
				}
			} while(next_permutation(aa.begin(), aa.end()));
		}
	}
	cout << ans / 2 << '\n';
}