import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# md = 10**9+7
md = 998244353

from math import gcd

a, b, c = LI()
g = gcd(a, b)

if gcd(g, c) > 1:
    print("INF")
    exit()

# a //= g
# b //= g
mx = max(a*b//g, g*c)
# print(a,b,g,mx)
# mx=4000000
dp = [1]+[0]*mx
for i in range(mx):
    if dp[i] == 0: continue
    for d in [a, b, c]:
        if i+d <= mx: dp[i+d] = 1

print(dp.count(0))