#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<P> vp;
typedef vector<ll> vll;

bool isKadomatsu(vector<int> a) {
	if (a[0] == a[1] || a[0] == a[2] || a[1] == a[2])
		return false;
	if ((a[1] - a[0]) * (a[1] - a[2]) < 0)
		return false;
	return true;
}

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

	const int N = 3;
	vector<int> a(N);
	rep(i, N) cin >> a[i];

	if (a[0] == a[1] || a[0] == a[2] || a[1] == a[2]) {
		cout << 0 << endl;
		return 0;
	}

	if ( (a[1] - a[0]) * (a[1] - a[2]) > 0) {
		cout << "INF" << endl;
		return 0;
	}

	int cnt = 0;
	rep2(p, 1, 1111) {
		vector<int> b(N);
		rep(i, N) b[i] = a[i] % p;
		if (isKadomatsu(b)) {
			cnt++;
		}
	}

	cout << cnt << endl;

}