#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int cnt[4000000];

int main(){
  vector<int> d(3);
  cin >> d[0] >> d[1] >> d[2];
  sort(d.begin(), d.end());
  int a = d[0]; int b = d[1]; int c = d[3];
  int flag = 0;
  flag = gcd(a, gcd(b, c));
  if(flag>1){
    cout << "INF" << endl;
    return 0;
  }
  for(int i = 0; i < b; i++){
    for(int j = 0; j < a; j++){
      for(int k = 0; k <= a*b/c; k++){
        cnt[a*i+b*j+c*k]++;
      }
    }
  }
  int ans = 0;
  for(int i = 1; i < a*b; i++){
    if(cnt[i]==0) ans++;
  }
  cout << ans << endl;
  return 0;
}