from itertools import *
from bisect import *
from math import *
from collections import *
from heapq import *
from random import *
from decimal import *
import numpy as np
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    def check(aa):
        if aa[0]==aa[1]:return False
        if aa[2]==aa[1]:return False
        if aa[0]==aa[2]:return False
        if aa[0]<=aa[1]<=aa[2]:return False
        if aa[2]<=aa[1]<=aa[0]:return False
        return True

    aa=LI()
    if check(aa):
        print("INF")
        exit()
    mx=max(aa)
    aa=np.array(aa)
    ans=0
    for d in range(3,mx+1):
        bb=aa%d
        if check(bb):ans+=1
    print(ans)

main()