#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
template <typename T>
struct binary_indexed_tree{
  int N;
  vector<T> BIT;
  binary_indexed_tree(int N): N(N), BIT(N + 1, 0){
  }
  void add(int i, T x){
    i++;
    while (i <= N){
      BIT[i] += x;
      BIT[i] %= MOD;
      i += i & -i;
    }
  }
  T sum(int i){
    T ans = 0;
    while (i > 0){
      ans += BIT[i];
      ans %= MOD;
      i -= i & -i;
    }
    return ans;
  }
};
int main(){
  int N;
  cin >> N;
  vector<int> X(N), Y(N);
  for (int i = 0; i < N; i++){
    cin >> X[i] >> Y[i];
  }
  vector<int> S(N), D(N);
  for (int i = 0; i < N; i++){
    S[i] = X[i] + Y[i];
    D[i] = X[i] - Y[i];
  }
  if (S[N - 1] < S[0]){
    for (int i = 0; i < N; i++){
      S[i] *= -1;
    }
  }
  if (D[N - 1] < D[0]){
    for (int i = 0; i < N; i++){
      D[i] *= -1;
    }
  }
  vector<int> S2 = S;
  sort(S2.begin(), S2.end());
  S2.erase(unique(S2.begin(), S2.end()), S2.end());
  for (int i = 0; i < N; i++){
    S[i] = lower_bound(S2.begin(), S2.end(), S[i]) - S2.begin();
  }
  vector<pair<int, int>> DS(N);
  for (int i = 0; i < N; i++){
    DS[i] = make_pair(D[i], S[i]);
  }
  sort(DS.begin(), DS.end());
  vector<int> p(N);
  for (int i = 0; i < N; i++){
    p[i] = lower_bound(DS.begin(), DS.end(), make_pair(D[i], S[i])) - DS.begin();
  }
  int cs = S2.size();
  vector<vector<pair<int, int>>> pp(cs);
  for (int i = 0; i < N; i++){
    pp[S[i]].push_back(make_pair(p[i], i));
  }
  binary_indexed_tree<long long> BIT(N);
  for (int i = 0; i < cs; i++){
    sort(pp[i].begin(), pp[i].end());
    int cnt = pp[i].size();
    for (int j = 0; j < cnt; j++){
      int id = pp[i][j].second;
      long long dp = BIT.sum(pp[i][j].first);
      if (id == 0){
        dp++;
      }
      if (id == N - 1){
        cout << dp << endl;
      }
      BIT.add(pp[i][j].first, dp);
    }
  }
}