#include<iostream>
#include<string>
#include<algorithm>
#include<functional>
#include<vector>
#include<set>
#include<queue>
#include<list>
#include<stdio.h>
#include<stdlib.h>
#include<map>
#include<cstdio>

#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

typedef long long ll;

using namespace std;

bool isKadomatu(ll a,ll b, ll c) {

	bool isDistinct = a != b && b != c && c != a;

	bool isBmax = b == max(a, max(b, c)) || b == min(a, min(b, c));

	return isDistinct && isBmax;

}

int main() {
	ll a, b, c;
	cin >> a >> b >> c;

	bool isKadomatu1 = isKadomatu(a, b, c);
	
	if (isKadomatu1) {
		cout << "INF" << endl;
		return 0;
	}

	int p = 1001;

	int ans = 0;
	for (int i = 1; i < p; i++) {
		if (isKadomatu(a%i, b%i, c%i)) {
			++ans;
		}
	}

	cout << ans << endl;
}