-- Try yukicoder
-- author: Leonardone @ NEETSDKASU


isKadomatsuRetsu :: [Int] -> Bool
isKadomatsuRetsu [a1, a2, a3] = a1 /= a3 && (a2 == minval || a2 == maxval)
    where
        a123 = [a1, a2, a3]
        minval = minimum a123
        maxval = maximum a123



main = putStrLn . solve . map read . words =<< getLine

solve [a1, a2, a3] = if isKadomatsuRetsu a123 then "INF" else show count
    where
        a123 = [a1, a2, a3]
        maxval = maximum a123
        modKadomatsu p = map (`mod` p) a123
        count = sum $ map (\p -> if isKadomatsuRetsu $ modKadomatsu p then 1 else 0 ) [1 .. maxval]