MOD = 998244353

# read input & initialize
N, X, Y = map(int, input().split())
if X > Y:
	X, Y = Y, X

# set start & end points
S = (1 if X == 1 else X + 1)
E = (N if Y == N else Y - 1)

# calculate answer
if S > E:
	print(0)
else:
	dp = [ 0 ] * (E - S + 1)
	dp[0] = 1
	for i in range(1, E - S + 1):
		dp[i] = (dp[i - 1] + (dp[i - 3] if i >= 3 else 0)) % MOD
	print(dp[E - S])