#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    my_putchar_unlocked(c[i]);
  }
}
template<class T, class U> inline T GCD_L(T a, U b){
  T r;
  while(b){
    r=a;
    a=b;
    b=r%a;
  }
  return a;
}
int dp[10000000];
int main(){
  int i;
  int A;
  rd(A);
  int B;
  rd(B);
  int C;
  rd(C);
  if(GCD_L(GCD_L(A, B), C)> 1){
    wt_L("INF");
    wt_L('\n');
    return 0;
  }
  dp[0] = 1;
  for(i=(0);i<(10000000);i++){
    if(dp[i]){
      if(i+A < 10000000){
        dp[i+A] = 1;
      }
      if(i+B < 10000000){
        dp[i+B] = 1;
      }
      if(i+C < 10000000){
        dp[i+C] = 1;
      }
    }
  }
  {
    int e98WHCEY;
    int cTE1_r3A;
    if(10000000==0){
      cTE1_r3A = 0;
    }
    else{
      cTE1_r3A = dp[0];
      for(e98WHCEY=(1);e98WHCEY<(10000000);e98WHCEY++){
        cTE1_r3A += dp[e98WHCEY];
      }
    }
    wt_L(10000000 -cTE1_r3A);
    wt_L('\n');
  }
  return 0;
}
// cLay version 20210103-1 [bug fixed 1]

// --- original code ---
// int dp[1d7];
// {
//   int @A, @B, @C;
//   if(gcd(A,B,C) > 1) wt("INF"), return 0;
//   dp[0] = 1;
//   rep(i,1d7) if(dp[i]){
//     if(i+A < 1d7) dp[i+A] = 1;
//     if(i+B < 1d7) dp[i+B] = 1;
//     if(i+C < 1d7) dp[i+C] = 1;
//   }
//   wt(1d7 - sum(dp(1d7)));
// }