#include #include #include #define Add(x, y) (x + y >= mod) ? (x + y - mod) : (x + y) #define lowbit(x) x & (-x) #define pi pair #define pii pair> #define iip pair, ll> #define ppii pair, pair> #define ls(k) k << 1 #define rs(k) k << 1 | 1 #define fi first #define se second #define full(l, r, x) for(auto it = l; it != r; ++it) (*it) = x #define Full(a) memset(a, 0, sizeof(a)) #define open(s1, s2) freopen(s1, "r", stdin), freopen(s2, "w", stdout); #define For(i, l, r) for(register int i = l; i <= r; ++i) #define _For(i, l, r) for(register int i = r; i >= l; --i) using namespace std; using namespace __gnu_pbds; typedef double db; typedef unsigned long long ull; typedef long long ll; bool Begin; inline ll read(){ ll x = 0, f = 1; char c = getchar(); while(c < '0' || c > '9'){ if(c == '-') f = -1; c = getchar(); } while(c >= '0' && c <= '9'){ x = (x << 1) + (x << 3) + (c ^ 48); c = getchar(); } return x * f; } inline void write(ll x){ if(x < 0){ putchar('-'); x = -x; } if(x > 9) write(x / 10); putchar(x % 10 + '0'); } int a, b, c, ans; bool check(int a, int b, int c){ if(a == b || a == c || b == c) return 0; if(b == min({a, b, c}) || b == max({a, b, c})) return 1; return 0; } bool End; int main(){ // open("mod.in", "mod.out"); a = read(), b = read(), c = read(); if(check(a, b, c)){ puts("INF"); exit(0); } for(int i = 3; i <= 1000; ++i) if(check(a % i, b % i, c % i)) ++ans; write(ans); cerr << '\n' << abs(&Begin - &End) / 1048576 << "MB"; return 0; }