#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, X, Y;
  cin >> N >> X >> Y;
  X--;
  Y--;
  if (X > Y){
    swap(X, Y);
  }
  vector<long long> dp(N, 0);
  if (X == 0){
    dp[0] = 1;
  } else {
    dp[X + 1] = 1;
  }
  for (int i = 0; i < N - 1; i++){
    dp[i + 1] += dp[i];
    dp[i + 1] %= MOD;
    if (i < N - 3){
      dp[i + 3] += dp[i];
      dp[i + 3] %= MOD;
    }
  }
  long long ans = 0;
  for (int i = 0; i < Y; i++){
    if ((Y - i) % 2 == 1){
      ans += dp[i];
    }
  }
  if (X == N - 2 && Y == N - 1){
    ans++;
  }
  ans %= MOD;
  cout << ans << endl;
}