#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())

bool f(ll a1, ll a2, ll a3) {
    if ((a1 == a2) || (a2 == a3) || (a1 == a3)) {
        return false;
    }
    vector<ll> v(3);
    v[0] = a1; v[1] = a2; v[2] = a3;
    sort(all(v));
    return ((v[0] == a2) || (v[2] == a2));
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll a1, a2, a3;
    cin >> a1 >> a2 >> a3;
    if (a1 > a3) swap(a1, a3);
    if (f(a1, a2, a3)) {
        cout << "INF" << endl;
        return 0;
    }
    ll ans = 0;
    reps(i, 1, 1001) {
        ll b1 = a1 % i;
        ll b2 = a2 % i;
        ll b3 = a3 % i;
        if (f(b1, b2, b3)) ans++;
    }
    cout << ans << endl;
    return 0;
}