#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------


int N,X,Y;
const ll mo=998244353;
ll dp[202020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>X>>Y;
	X--,Y--;
	if(X>Y) swap(X,Y);
	
	if(X==0&&Y==N-1) {
		dp[0]=1;
		FOR(i,N) {
			(dp[i+1]+=dp[i])%=mo;
			(dp[i+3]+=dp[i])%=mo;
		}
		cout<<dp[N-1]<<endl;
	}
	else if(X==0) {
		aaa:
		dp[0]=1;
		FOR(i,N) {
			(dp[i+1]+=dp[i])%=mo;
			(dp[i+3]+=dp[i])%=mo;
		}
		cout<<dp[Y-1]<<endl;
	}
	else if(Y==N-1) {
		swap(X,Y);
		X=N-1-X;
		Y=N-1-Y;
		goto aaa;
	}
	else {
		ll D=Y-X;
		if(D==1) {
			cout<<0<<endl;
			return;
		}
		dp[0]=1;
		FOR(i,D+1) {
			(dp[i+1]+=dp[i])%=mo;
			(dp[i+3]+=dp[i])%=mo;
		}
		cout<<dp[D-2]<<endl;
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}