#include #include #define rep(i,b) for(int i=0;i=0;i--) #define rep1(i,b) for(int i=1;i using mpq = priority_queue, greater>; template bool chmax(T &a, const T &b) { if (a bool chmin(T &a, const T &b) { if (b ll sumv(const vector&a){ll res(0);for(auto&&x:a)res+=x;return res;} bool yn(bool a) { if(a) {cout << "Yes" << endl; return 1;} else {cout << "No" << endl; return 0;}} #define dame { cout << "No" << endl; return 0;} #define dame1 { cout << -1 << endl; return 0;} #define test(x) cout << "test" << x << endl; #define deb(x,y) cout << x << " " << y << endl; #define deb3(x,y,z) cout << x << " " << y << " " << z << endl; #define deb4(x,y,z,x2) cout << x << " " << y << " " << z << " " << x2 << endl; #define out cout << ans << endl; #define outv fore(yans , ans) cout << yans << "\n"; #define show(x) cerr<<#x<<" = "<; using pil = pair; using pli = pair; using pii = pair; using tp = tuple; using vi = vector; using vl = vector; using vs = vector; using vb = vector; using vpii = vector; using vpli = vector; using vpll = vector; using vpil = vector; using vvi = vector>; using vvl = vector>; using vvs = vector>; using vvb = vector>; using vvpii = vector>; using vvpli = vector>; using vvpll = vector; using vvpil = vector; using mint = modint998244353; using vm = vector; using vvm = vector>; vector dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1}; ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;} ll lcm(ll a, ll b) { return a/gcd(a,b)*b;} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; int main(){ int n; cin>>n; int x,y; cin>>x>>y; x--; y--; vvm dp(n,vm(4)); dp[0][0] = 1; dp[0][3] = 1; rep1(i,n){ dp[i][0] = dp[i-1][2] + dp[i-1][3]; dp[i][1] = dp[i-1][3]; dp[i][2] = dp[i][1]; dp[i][3] = dp[i-1][0] + dp[i][0]; } if (x > y) swap(x , y); if (x+1 == y){ if (x == 0 || y == n-1) cout << 1 << endl; else cout << 0 << endl; return 0; } int st = x + 1; int go = y - 1; if (x == 0) st = 0; if (y == n-1) go = n-1; if (st%2 == 1){ st--; go--; } mint ans; int k = (go - st) / 2; if (go%2 == 0) ans = dp[k][0]; else ans = dp[k][3]; cout << ans.val() << endl; return 0; }