def is_kadomatsu(lst):
    if len(set(lst)) != 3:
        return False
    a2 = lst[1]
    return a2 == max(lst) or a2 == min(lst)

A = list(map(int,input().split()))
if len(set(A)) != 3:
    ans = 0
elif is_kadomatsu(A):
    ans = "INF"
else:
    ans = 0
    scope = max(A)
    for p in range(2,scope + 1):
        if is_kadomatsu([x % p for x in A]):
            ans+=1
print(ans)