#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pen(str) return cout<<str<<endl,0
#define pex(str) {cout<<str<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int main(void){
	int a[3];
	int b[3];
	cin>>a[0]>>a[1]>>a[2];
	if(a[0]==a[1]||a[1]==a[2]||a[2]==a[0])pex(0);
	if(a[0]<a[1]&&a[2]<a[1]||a[0]>a[1]&&a[2]>a[1])pex("INF");
	int c=0;
	rep(p,1,*max_element(a,a+3)+1){
		re(i,3)b[i]=a[i]%p;
		if(b[0]==b[1]||b[1]==b[2]||b[2]==b[0])continue;
		if(b[0]<b[1]&&b[2]<b[1]||b[0]>b[1]&&b[2]>b[1])c++;
	}
	cout<<c<<endl;

	return 0;
}