#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N, p, q;
  cin >> N >> p >> q;
  if (p == 1 && q == 1){
    cout << 1 << endl;
  } else if (p == 1 || q == 1){
    cout << 2 << endl;
  } else {
    vector<int> A(N);
    for (int i = 0; i < N; i++){
      A[i] = i;
    }
    reverse(A.begin(), A.begin() + p);
    reverse(A.end() - q, A.end());
    vector<int> c;
    vector<bool> used(N, false);
    for (int i = 0; i < N; i++){
      if (!used[i]){
        used[i] = true;
        int cnt = 1;
        int p = i;
        while (true){
          p = A[p];
          if (used[p]){
            break;
          }
          used[p] = true;
          cnt++;
        }
        c.push_back(cnt);
      }
    }
    int cnt = c.size();
    long long ans = 1;
    for (int i = 0; i < cnt; i++){
      ans = lcm(ans, c[i]);
    }
    cout << ans * 2 % MOD << endl;
  }
}