n, x, y = map(int, input().split())
mod = 998244353
if y < x:
    x, y = y, x


def guchoku(n, x, y):
    res = 0
    from itertools import permutations

    kumiawase = permutations(range(1, 1 + n), n)
    for kumi in kumiawase:
        if kumi[0] != x or kumi[-1] != y:
            continue
        flag = 1

        for i in range(n - 1):
            if abs(kumi[i + 1] - kumi[i]) > 2:
                flag = 0
                break
        if flag:
            # print(kumi)
            res += 1
    return res


# if n <= 10:
#     print(guchoku(n, x, y))
#     exit()

delta = abs(y - x)

if delta == 1:
    if x == 1 or y == 1:
        print(1)
    elif x == n or y == n:
        print(1)
    else:
        print(0)
    exit()
if delta <= 2:
    print(1)
    exit()

if x == 1:
    xx = x
else:
    xx = x + 1
if y == n:
    yy = n
else:
    yy = y - 1
delta = abs(xx - yy)

memo = [0] * (delta + 1)
memo[0] = 1
for i in range(delta):
    ni = i + 1
    if ni <= delta:
        memo[ni] += memo[i]
        memo[ni] %= mod
    ni = i + 3
    if ni <= delta:
        memo[ni] += memo[i]
        memo[ni] %= mod
print(memo[-1])