n, x, y = map(int,input().split())
if y < x: x, y = y, x
mod = 998244353
dp = [0] * (2 * 10 ** 5 + 100)
#S = 0, T = N - 1の場合の答え
dp[0] = 1
for i in range(0, 2 * 10 ** 5 + 1):
    dp[i + 1] += dp[i]
    dp[i + 3] += dp[i]
    dp[i + 1] %= mod
    dp[i + 3] %= mod
if x != 1:
    x += 1
if y != n:
    y -= 1
print(dp[y - x])