import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

#2D matrix
mod = 998244353
def mat_add(A, B):
    assert len(A)==len(B) and len(A[0]) == len(B[0])
    n = len(A)
    m = len(A[0])
    for i in range(n):
        for j in range(m):
            A[i][j] += B[i][j]
    return A


def mat_mul(A,B):
    assert len(A[0]) == len(B)
    n = len(A)
    m = len(B[0])
    p = len(A[0])
    R = [[0 for j in range(m)]for i in range(n)]
    for i in range(n):
        for j in range(m):
            for k in range(p):
                R[i][j] += A[i][k]*B[k][j]
                R[i][j] %= mod
    return R

def mat_pow(A, x):
    assert len(A)==len(A[0])
    n = len(A)
    R = [[0 for j in range(n)]for i in range(n)]
    for i in range(n):
        R[i][i] = 1
    while x > 0:
        if x&1:
            R = mat_mul(R, A)
        A = mat_mul(A,A)
        x >>= 1
    return R

def mat_pri(A):
    for i in A:
        print(*i)


def f(N):
    a = [[1,0,1],[1,0,0],[0,1,0]]
    f = [[1],[1],[1]]
    if N == 0:
        return 0
    if N <= 3:
        return 1
    return mat_mul(mat_pow(a, N-3), f)[0][0]

N, X, Y = na()
L = abs(Y-X)-1
if X==1 or X==N:
    L += 1
if Y==1 or Y==N:
    L+= 1
print(f(L))