#N = int(input())
A = [int(i) for i in input().split()]
#s = [[int(j) for j in input().split()] for i in range(N)]

def isPine(L):
    return len(set(L))==len(L) and sorted(L)[1] != L[1]

if isPine(A):
    print("INF")
else:
    res = 0
    for p in range(1,max(A)+1):
        B = [num % p for num in A]
        if isPine(B):
            res+=1
    print(res)