#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define rep(i,x) for(int i=0;i<(int)(x);++i)
#define reps(i,x) for(int i=1;i<=(int)(x);++i)
#define pb push_back

int n, m, p;
vi a(3), b(3);

int vec_max(vi a){
    return *max_element(a.begin(), a.end());
}

int vec_min(vi a){
    return *min_element(a.begin(), a.end());
}

vi vec_uni(vi a){
    set<int> s(a.begin(), a.end());
    return vi(s.begin(), s.end());
}

int main(){
    ios::sync_with_stdio(false);
    rep(i, 3) cin >> a[i];
    if (vec_uni(a).size() == 3 && (vec_max(a) == a[1] || vec_min(a) == a[1])) {
        cout << "INF" << "\n";
    } else {
        int cnt = 0;
        reps(i, vec_max(a)) {
            rep(j, 3) b[j] = a[j]%i;
            if (vec_uni(b).size() != 3) continue;
            if (vec_max(b) == b[1] || vec_min(b) == b[1]) ++cnt;
        }
        cout << cnt << "\n";
    }
    return 0;
}