#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    int n, x, y; cin >> n >> x >> y;

    if (n <= 10) {
        auto v = vec<int>(uns, n);
        iota(begin(v), end(v), 1);

        int naive = 0;
        do {
            if (v[0] != x || v[n - 1] != y) {
                continue;
            }

            bool f = false;
            for (int i = 1; i < n; ++i) {
                if (2 < abs(v[i] - v[i - 1])) {
                    f = true;
                    break;
                }
            }

            naive += !f;
        } while (next_permutation(begin(v), end(v)));

        cout << naive << endl;
        return 0;
    }

    if (!(x < y)) {
        swap(x, y);
    }

    if (y - x == 1) {
        cout << (x == 1) << endl;
        return 0;
    }

    if (x != 1) {
        ++x;
    }

    auto dp = vec<mint>(uns, n + 1);

    dp[0] = 1;
    for (int i = 1; i <= n; ++i) {
        dp[i] = dp[i - 1];

        if (0 <= i - 4) {
            dp[i] += dp[i - 3];
        }
    }

    if (y != n) {
        cout << dp[y - x].val() << endl;
    }
    else {
        cout << dp[y - x + 1].val() << endl;
    }
}