import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1<<63)-1
inf = (1 << 31)-1
# md = 10**9+7
md = 998244353

n, x, y = LI()
if x > y: x, y = y, x

dp = [0]*n
dp[0] = 1
for i in range(n-1):
    if i-2 >= 0: dp[i+1] = (dp[i]+dp[i-2])%md
    else: dp[i+1] = dp[i]

if x == 1 and y == n:
    print(dp[y-x])
elif x == 1 or y == n:
    print(dp[y-x-1])
else:
    d = y-x-2
    if d < 0:
        print(0)
    else:
        print(dp[d])