#include using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define rep2(i, x, n) for(int i = x; i <= n; i++) #define rep3(i, x, n) for(int i = x; i >= n; i--) #define each(e, v) for(auto &e: v) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define sz(x) (int)x.size() using ll = long long; using pii = pair; using pil = pair; using pli = pair; using pll = pair; const int MOD = 1000000007; //const int MOD = 998244353; const int inf = (1<<30)-1; const ll INF = (1LL<<60)-1; template bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;}; template bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;}; struct io_setup{ io_setup(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cout << fixed << setprecision(15); } } io_setup; int main(){ int A, B, C; cin >> A >> B >> C; int g = 0; g = gcd(g, A), g = gcd(g, B), g = gcd(g, C); if(g != 1) {cout << "INF\n"; return 0;} if(A == 1 || B == 1 || C == 1) {cout << "0\n";} int MAX = 10000000; vector used(MAX, false); rep(i, B){ rep(j, A){ int k = A*i+B*j; used[k] = true; } } int D = gcd(A, B); rep(i, MAX){ if(i >= A*B && i%D == 0) used[i] = true; } vector used2(C, false); rep(i, MAX){ if(used2[i%C]) used[i] = true; else if(used[i]) used2[i%C] = true; } int ans = 0; rep(i, MAX){ if(!used[i]) ans++; } cout << ans << '\n'; }