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