#include <bits/stdc++.h>
using namespace std;

// 基本テンプレート
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define MAT(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define REP(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define RREP(i,a,n) for(int i=(a); i>n; --i)
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter
#define MP make_pair
#define cauto const auto&
#define UNIQUE(v) v.erase( unique(ALL(v)), v.end() );
#define len(x) ((int)(x).size())

// 型
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<string, string> pss;
typedef pair<string, int> psi;
typedef pair<int, string> pis;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long> vl;
typedef vector<long long> vll;
typedef vector<string> vs;



// Effective std
template<typename C> void remove(vector<C>& c, unsigned int index) { c.erase(c.begin()+index); }


// 定数
#define PI acos(-1.0)
constexpr int EPS = (1e-9);
constexpr int INF = 100000000;



int main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
//	cout << fixed << setprecision(1);

	vi v(3); for(auto &i : v) cin >> i;

	if (v[0] == v[1] || v[1] == v[2] || v[0] == v[2]) {
		P(0);
		return 0;
	}
	if (*max_element(ALL(v)) == v[1] || *min_element(ALL(v)) == v[1]) {
		P("INF");
		return 0;
	}

	int ans = 0;
	REP(i, 1, *max_element(ALL(v)) + 1) {
		vi a {v[0] % i, v[1] % i, v[2] % i};
		if (a[0] == a[1] || a[1] == a[2] || a[0] == a[2]) continue;
		if ((a[0] < a[1] && a[1] > a[2]) || (a[0] > a[1] && a[1] < a[2])) ++ans;
	}
	P(ans);

    return 0;
}