#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define ALL(a) (a).begin(), (a).end()
template <class t, class u> void chmax(t& a, u b) {
    if (a < b) a = b;
}
template <class t, class u> void chmin(t& a, u b) {
    if (b < a) a = b;
}
template <class t> using vc = vector<t>;
template <class t> using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
using uint = unsigned;
using ull = unsigned long long;
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
int lcm(int a, int b) { return a / __gcd(a, b) * b; }
signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
    using mint = atcoder::modint998244353;
    int n, x, y;
    cin >> n >> x >> y;
    if (x > y) swap(x, y);
    x--, y--;
    vc<mint> dp(n);
    if (x == 0) {
        // 上がるだけ
        dp[x] = 1;
    } else {
        // X~0~X-1->(+2)->Yしかない
        // x+1からは通常通り数える
        dp[x + 1] = 1;
    }
    rep(i, n - 1) {
        dp[i + 1] += dp[i];
        if (i < n - 3) {
            dp[i + 3] += dp[i];
        }
    }
    mint ans = dp[y - 1];
    if (y == n - 1) {
        // ラスト1回
        if (y >= 3) {
            ans += dp[y - 3];
        }
        // 端数が2のとき
        if (n != 2 && x == n - 2) ans++;
    }
    cout << ans.val() << endl;
}