#include <bits/stdc++.h>
    using namespace std;
    #include <math.h>
    #include <iomanip>
    #include <cstdint>
    #include <string>
    #include <sstream>
    
    template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
    template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
    #define rep(i,n) for (int i = 0; i < (n); ++i)

    typedef long long ll;
    typedef unsigned long long ull;
    using P=pair<ll,ll>;
    using tp=tuple<ll,ll,ll>;
    const int INF=1001001001;
    const ll INFL=1e18;
    const int mod=998244353;
    
    
    void solve(){
        int n,x,y;
        cin>>n>>x>>y;
        if(x>y){swap(x,y);}
        if(x!=1)x++;
        if(y!=n)y--;
        int d=y-x;
        if(d<0){cout<<0<<endl;return;}
        vector<ll>dp(d+1);
        dp[0]=1;
        for(int i=0;i<d;i++){
            (dp[i+1]+=dp[i])%=mod;
            if(i+3<=d)(dp[i+3]+=dp[i])%=mod;
        }
        cout<<dp[d]<<endl;
    }  

    int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        
        solve();
        
        return 0;
    }