#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <string>
#include <stdio.h>

using namespace std;

int main() {

	int A[3], m = -1;
	for (int i = 0; i < 3; i++) {
		cin >> A[i];
		m = max(m, A[i]);
	}

	if ( (A[0] < A[1] && A[2] < A[1] && A[2] != A[0]) || (A[0] > A[1] && A[2] > A[1] && A[2] != A[0])) {
		cout << "INF" << endl;
		return 0;
	}

	int cnt = 0;
	for (int i = 1; i <= m; i++ ) {
		if ((A[0] % i < A[1] % i && A[2] % i < A[1] % i && A[2] % i != A[0] % i) ||
			(A[0] % i > A[1] % i && A[2] % i > A[1] % i && A[2] % i != A[0] % i)) cnt++;
	}

	cout << cnt << endl;

	return 0;
}