#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(int (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(int (i)=(a)-1;(i)>=(b);(i)--)
#define PI acos(-1.0)
#define DEBUG(C) cout<<C<<endl;
#define VI vector<int>
#define VII vector<VI>
#define VL vector<LL>
#define VLL vector<VL>
#define VD vector<double>
#define VDD vector<VD>
#define PII pair<int,int>
#define PDD pair<double,double>
#define PLL pair<LL,LL>
#define ALL(a) (a).begin(),(a).end()
#define SORT(a) sort(ALL(a))
#define REVERSE(a) reverse(ALL(a))
#define MP make_pair
#define EP emplace_back
#define FORE(a,b) for(auto &&a:b)

using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int INF=1e9;
const int MOD=INF+7;

bool c(vector<int> a){
    int ma=0,mi=INF;
    REP(i,3){
        ma=max(ma,a[i]);
        mi=min(mi,a[i]);
    }
    if(ma==a[1] || mi==a[1]){
        if(a[0]!=a[1] && a[1]!=a[2] && a[2]!=a[0]) return true;
    }
    return false;
}

int main (void){
    vector<int> a(3);
    REP(i,3) cin>>a[i];
    if(c(a)){
        cout<<"INF"<<endl;
        return 0;
    }
    int cnt=0;
    REP(i,*max_element(ALL(a))){
        vector<int> v(3);
        REP(j,3) v[j]=a[j]%(i+1);
        if(c(v)) cnt++;
    }
    cout<<cnt<<endl;
}