#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <list>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <map>

using namespace std;

bool kadomatu(int a,int b,int c){
    return a!=b&&b!=c&&c!=a&&((a<b && c<b)||(a>b && c>b));
}

int main(){
	int i, j, k, l, m, n,x,y;
    
    int a,b,c;
    
    cin >> a>>b>>c;
    
    if (kadomatu(a,b,c)){
        cout << "INF";
        return 0;
    }
    
    m= max(max(a,b),c);
    
    j=0;
    for (i=2;i<=m;i++){
        if (kadomatu(a%i,b%i,c%i)){j++;}//cout<<(a%i)<<" "<<(b%i)<<" "<<(c%i)<<endl;}
    }
    
    cout << j << endl;
    
    
	return 0;
}