import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')




proc solve()=
  var
    a = scan()
    b = scan()
    c = scan()
    g = gcd(a,gcd(b,c))
  if g == 1:
    var
      x = @[a,b,c]
    x.sort
    var
      n = x[1]*x[2]-x[1]-x[2]
      dp = newseqwith(n+1,false)
    dp[0]=true
    for i in 1..n:
      for j in 0..2:
        if i-x[j]>=0:
          dp[i] = dp[i] or dp[i-x[j]]
    echo dp.count(false)

  else:
    echo "INF"

  
solve()