from math import gcd
def lcm(a, b):
    return a // gcd(a, b) * b
def solve():
    n, p, q = map(int, input().split())
    if n == 1:
        return 1
    if p == 1 or q == 1:
        return 2 if p != 1 or q != 1 else 1
    if p == q == n:
        return 2
    if p + q <= n:
        return 4
    a = list(range(n))
    a[:p] = a[p-1::-1]
    a[-q:] = a[:-q-1:-1]
    visited = [False] * n
    ans = 1
    for i in range(n):
        if visited[i]:
            continue
        cnt = 0
        while not visited[i]:
            visited[i] = True
            cnt += 1
            i = a[i]
        ans = lcm(ans, cnt)
    return ans * 2

print(solve() % 998244353)