#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

int main() {
	int a,b,c;
	int ans = 0;
	cin >> a >> b >> c;
	int max_n = max(a,max(b,c)),min_n = min(a,min(b,c));
	if(a == b || a == c || b == c){
		cout << ans << endl;
	}else if(b == max_n || b == min_n){
		cout << "INF" << endl;
	}else{
		for(int i = 1;i <= max_n;i++){
			int na = a % i,nb = b % i,nc = c % i;
			int max_nn = max(na,max(nb,nc)),min_nn = min(na,min(nb,nc));
			if((nb == max_nn || nb == min_nn) && na != nb && na != nc && nb != nc){
				ans++;
			}
		}
		cout << ans << endl;
	}
	return 0;
}