#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
const double PI=acos(-1);
const double EPS=1e-10;
const int inf=1e9;
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
int main(){
	int a,b,c;
	cin>>a>>b>>c;
	if(((a>b&&b<c)||(a<b&&b>c))&&a!=c){
		cout<<"INF"<<endl;
	}else{
		int ma=max(a,b);
		ma=max(ma,c);
		int co=0;
		loop(i,2,ma+1){
			int d=a%i,e=b%i,f=c%i;
			if(((d>e&&e<f)||(d<e&&e>f))&&d!=f){
				co++;
			}
		}
		cout<<co<<endl;
	
	}
}