#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int main(int argc, char **argv) {
	int A[3], s[3], b[3], t[3];
	REP(i, 3) {
		cin >> A[i];
		s[i] = A[i];
	}
	sort(s, s + 3);
	if (s[0] == s[1] || s[1] == s[2]) {
		cout << 0 << endl;
	}
	else if (A[1] == s[0] || A[1] == s[2]) {
		cout << "INF" << endl;
	}
	else {
		int res = 0;
		REP(i, s[2]) {
			REP(j, 3) b[j] = t[j] = A[j] % (i + 1);
			sort(t, t + 3);
			if (t[0] != t[1] && t[1] != t[2] && (b[1] == t[0] || b[1] == t[2])) ++res;
		}
		cout << res << endl;
	}

	return 0;
}