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

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;

ll gcd(ll x, ll y) {
    if (y == 0) return x;
    return gcd(y, x % y);
}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, X, Y;
    cin >> N >> X >> Y;
    if (X > Y) swap(X, Y);
    if (N < 4) {
        cout << "1\n";
        return 0;
    }
    if (Y - X == 1) {
        if (1 < X && Y < N) {
            cout << "0\n";
        } else {
            cout << "1\n";
        }
        return 0;
    }
    int D = Y - X;
    if (X > 1) D--;
    if (Y < N) D--;
    vector<ll> F(D + 1, 1);
    FOR(i, 3, D + 1) F[i] = (F[i - 1] + F[i - 3]) % MOD;
    cout << F[D] << endl;
}