#include <bits/stdc++.h> 
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
 #define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)


ll mod=998244353;

int main() {
    ll N,X,Y;cin>>N>>X>>Y;
if(X>Y) swap(X,Y);
if(Y-X==1) {
    if(X!=1&&Y!=N) {
        cout<<0<<endl;
    }
    else cout<<1<<endl;
    return 0;
}

ll K=Y-X+1;
vector<ll> dp(K,0);
dp[0]=1;
for(ll i=1;i<K;i++) {
    if(i-3>=0) dp[i]+=dp[i-3];
   dp[i]+=dp[i-1];
   dp[i]%=mod;
}

if(X==1&&Y==N) {
    cout<<dp.back()<<endl;
}
else if(X==1||Y==N) {
    cout<<dp[K-2]<<endl;
}

else {
    cout<<dp[K-3]<<endl;
}
}