Binary search example 3

n, x, y = map(int, input().split())
t = min(x, y)
n -= 1

left = -1
right = n *  x + 1
while right - left > 1:
  mid = (left + right) // 2
  if mid // x + mid // y < n:
    left = mid
  else:
    right = mid

print(t + right)