#include <iostream>
#include <vector>
#include <cmath>
#include <iomanip>
#include <array>
#include <tuple>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <list>
#include <cstdio>
#include <limits.h>
#include <string.h>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define GRESORT(v) sort(v.begin(),v.end(),greater<int>())
#define REVERSE(v) reverse(v.begin(),v.end())
#define overlap(v) v.erase(unique(v.begin(),v.end()),v.end())
#define debug(x) cout << #x << ": " << x << endl
#define INF 999999999

//4近傍
//int dy[]={0, 0, 1, -1};
//int dx[]={1, -1, 0, 0};

//8近傍
int dy[]={0,0,1,-1,1,1,-1,-1};
int dx[]={1,-1,0,0,1,-1,1,-1};

vector<int> a(3);

void input(){
    for(int i = 0; i < 3; i++) cin >> a[i];
}

int check(){
    if(a[0] == a[1] || a[0] == a[2] || a[1] == a[2]) return 0;
    if((a[1]-a[0])*(a[1]-a[2]) > 0) return INF;
    int m = max(a[0],max(a[1],a[2]));
    int count = 0;
    for(int i = 1; i <= m; i++) {
        int x = a[0] % i, y = a[1] % i, z = a[2] % i;
        int ma = max(x,max(y,z));
        int mi = min(x,min(y,z));
        if(x == y || x == z || y == z) continue;
        if(ma == y || mi == y) count++;
    }
    return count;
}

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

    input();
    if(check() == INF) cout << "INF" << endl;
    else cout << check() << endl;

    return 0;
}