#include <bits/stdc++.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) { cout << #a << " = " << a << endl; }
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }
template<class T> void operator>> (istream& ist, vector<T>& vs) { for(auto& e: vs) cin >> e; }

typedef long long ll;
int const inf = 1<<29;

bool is_kado(std::vector<int> const& A) {
  if (A.size() != 3) { return false; }
  return A[0] != A[2] &&
    ((A[1] > A[0] && A[1] > A[2]) ||
     (A[1] < A[0] && A[1] < A[2]));
}

int main() {

  std::vector<int> A(3); cin >> A;
  if (is_kado(A)) {
    std::cout << "INF\n";
    return 0;
  }

  int ans = 0;
  for (int p = 1; p < 1001; p++) {
    vector<int> B;
    rep(i, 3)
      B.push_back(A[i] % p);
    if (is_kado(B)) {
      ans++;
    }
  }

  std::cout << ans << "\n";
}