#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
using namespace std;

typedef long long ll;

int main(){
	int a[3];
	cin >> a[0] >> a[1] >> a[2];

	int check[3];
	int count = 0;
	int max = a[0];
	if ((a[0] == a[1]) || (a[1] == a[2]) || (a[0] == a[2])){
		cout << 0 << endl;
	}
	else if ((a[1] > a[0] && a[1] > a[2]) || (a[1] < a[0] && a[1] < a[2])){
		cout << "INF" << endl;
	}
	else{
		if (a[1] > max){
			max = a[1];
		}if (a[2] > max){
			max = a[2];
		}
		for (int i = 1; i <= max; i++){
			check[0] = a[0] % i;
			check[1] = a[1] % i;
			check[2] = a[2] % i;
			if (check[0] == check[1] || check[1] == check[2] || check[0] == check[2]){
				continue;
			}
			if ((check[1] > check[0] && check[1] > check[2]) || (check[1] < check[0] && check[1] < check[2])){
				count++;
			}
		}
		cout << count << endl;
	}

	return 0;
}