#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include <unordered_set>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=998244353;

ll solve(int D){

    //0,1,2,3..,D
    vector<ll> dp(D+2,0);
    
    dp[0]=1;

    for(int i=1;i<=D;i++){
        if(i>=1){
            dp[i]+=dp[i-1];
            dp[i]%=MOD;
        }
        if(i>=3){
            dp[i]+=dp[i-3];
            dp[i]%=MOD;
        }
    }
    return dp[D];
}

int main(){
    int N,X,Y;
    cin>>N>>X>>Y;

    if(X>Y) swap(X,Y);

    //X<Y

    int X0=(X==1?1:X+1);
    int Y0=(Y==N?N:Y-1);

    int D=Y0-X0;
    //cout<<"D="<<D<<endl;

    if(D<0){
        cout<<0<<endl;
        return 0;
    }else{

        cout<<solve(D)<<endl;

    }

}