#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int kado(vector<int> V){
  int c = V[1];
  sort(all(V));
  if(V[1]==c) return 0;
  if(V[0]==V[1]||V[1]==V[2]) return 0;
  return 1;
}

int main(){
  vector<int> A(3); rep(i,3) cin >> A[i];
  if(kado(A)) cout << "INF" << endl;
  else{
    int ans = 0;
    for(int p=1;p<=2000;p++){
      auto B=A;
      rep(i,3) B[i]%=p;
      if(kado(B)) ans++;
    }
    cout << ans << endl;
  }
  return 0;
}