#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)

using namespace std;
using LL = long long;
using P = pair<int,int>;
const int INF = 2e9;

int main(){
	vector<int> A(3);
	rep(i,3) cin >> A[i];
	sort(A.begin(), A.end());
	if(gcd(gcd(A[0], A[1]), A[2]) != 1){
		cout << "INF" << endl;
		return 0;
	}
	vector<int> res(A[0], INF);
	rep(y,A[0]){
		rep(z,A[0]){
			int sum = y * A[1] + z * A[2];
			int num = sum % A[0];
			res[num] = min(res[num], sum / A[0]);
		}
	}
	int ans = 0;
	rep(i,A[0]) ans += res[i];
	cout << ans << endl;

  return 0;
}