#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

bool is_kadomatsu(vector<ll> A){
    if(A[0]<A[1] && A[1]>A[2] && A[0]!=A[2]){
        return true;
    }
    else if(A[0]>A[1] && A[1]<A[2] && A[0]!=A[2]){
        return true;
    }
    else{
        return false;
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    vector<ll> A(3);

    FOR(i, 0, 3){
        cin >> A[i];
    }

    if(is_kadomatsu(A)){
        p("INF");
        return 0;
    }

    ll max_a = *max_element(ALL(A));
    ll count = 0;
    FOR(i, 1, max_a+1){
        vector<ll> B;
        B.push_back(A[0]%i);
        B.push_back(A[1]%i);
        B.push_back(A[2]%i);
        if(is_kadomatsu(B)){
            count++;
        }
    }
    p(count);
    
    return 0;
}