#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
ll MOD = 998244353;
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n,x,y;
    cin >> n >> x >> y;
    if(x>y) swap(x,y);
    ll m = y-x-1+(x==1)+(y==n);
    if(!m){
        cout << 0 << '\n';
        return 0;
    }
    vector<ll> dp(m,0);
    dp[0] = 1;
    rep(i,m-1){
        dp[i+1] = (dp[i+1] + dp[i]) % MOD;
        if(i+3<m) dp[i+3] = (dp[i+3] + dp[i]) % MOD;
    }
    cout << dp[m-1] << '\n';
    return 0;
}