#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
 
using namespace std;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
 
#define MOD 1000000009

int isKadomatsu(int a, int b, int c){
  if((a<b&&a>c)||(a>b&&a<c)||(c<a&&c>b)||(c>a&&c<b))return 1;
  return 0;
}

int main(){
  int a,b,c;
  cin>>a>>b>>c;
  if(isKadomatsu(a,b,c)==1){
    cout << "INF" << endl;
    return 0;
  }
  if(a==b||a==c||b==c){
    cout << 0 << endl;
    return 0;
  }
  int ans = 0;
  rep(i,1,2000){
    int a1 = a%i;
    int b1 = b%i;
    int c1 = c%i;
    if(isKadomatsu(a1,b1,c1)==1){
      ans++;
    }
  }
  cout << ans << endl;
  return 0;
}