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

#ifdef _RUTHEN
#include "debug.hpp"
#else
#define show(...) true
#endif

using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> using V = vector<T>;

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N, X, Y;
    cin >> N >> X >> Y;
    if (X > Y) swap(X, Y);
    int lb = (X == 1 ? X : X + 1);
    int ub = (Y == N ? Y : Y - 1);
    int len = ub - lb + 1;
    V<mint> p(N + 1, 0);
    p[0] = 0, p[1] = 1, p[2] = 1;
    for (int i = 3; i <= N; i++) p[i] = p[i - 1] + p[i - 3];
    len = max(len, 0);
    mint ans = p[len];
    cout << ans.val() << '\n';
    return 0;
}