#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

  int a, b, c;
  cin >> a >> b >> c;
  int m = max(a, max(b, c));

  int ans = 0;
  int x = -1, y = -1, z = -1;
  int d, e, f, i = 1;
  while(1) {
    d = a % i;
    e = b % i;
    f = c % i++;
    if((d != e && d != f) && ((e > d && e > f) || (e < d && e < f))) ans++;
    if(i > m &&  d == x && e == y && f == z) break;
    x = d;
    y = e;
    z = f;
  }

  if((d != e && d != f) && ((e > d && e > f) || (e < d && e < f))) cout << "INF" << endl;
  else cout << ans << endl;

	return 0;
}