local mod = 998244353
local n, x, y = io.read("*n", "*n", "*n")
if y < x then x, y = y, x end
if n == 2 then print(1) os.exit() end

local function walk(a)
  if a == 0 then return 0 end
  local t = {1}
  for i = 2, a do
    if 3 < i then
      t[i] = (t[i - 1] + t[i - 3]) % mod
    else
      t[i] = t[i - 1]
    end
  end
  return t[a]
end

local ret = 1
if x == 1 then
  if y == n then
    ret = walk(n)
  else
    ret = walk(y - 1)
  end
else
  if y == n then
    ret = walk(n - x)
  else
    ret = walk(y - x - 1)
  end
end
print(ret)