#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
/*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
inline bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
inline bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

// v1をソートし、v2を対応する位置に移動する
template <typename T, typename U>
void pairSort(vector<T> &v1, vector<U> &v2, bool rev = false) {
  int n = v1.size();
  vector<pair<T, U>> p(n);
  for (int i = 0; i < n; i++) {
    p[i] = pair<T, U>(v1[i], v2[i]);
  }
  if (rev) {
    sort(p.begin(), p.end(), [&](const auto &l, const auto &r) {
      if (l.first == r.first)
        return l.second > r.second;
      else
        return l.first < r.first;
    });
  } else {
    sort(p.begin(), p.end());
  }
  for (int i = 0; i < n; i++) {
    v1[i] = p[i].first;
    v2[i] = p[i].second;
  }
}

// ModInt
// 参考：https://ei1333.github.io/luzhiled/snippets/math/mod-int.html
// modはコンパイル時に決定
template <ll mod>
struct ModInt {
  ll x;
  ModInt() : x(0) {}
  ModInt(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
  constexpr ModInt &operator+=(const ModInt &p) {
    if ((x += p.x) >= mod)
      x -= mod;
    return *this;
  }
  constexpr ModInt &operator-=(const ModInt &p) {
    if ((x += mod - p.x) >= mod)
      x -= mod;
    return *this;
  }
  constexpr ModInt &operator*=(const ModInt &p) {
    x = x * p.x % mod;
    return *this;
  }
  constexpr ModInt &operator/=(const ModInt &p) {
    *this *= p.inverse();
    return *this;
  }
  constexpr ModInt operator-() { return ModInt(-x); }
  constexpr ModInt operator+(const ModInt &p) { return ModInt(*this) += p; }
  constexpr ModInt operator-(const ModInt &p) { return ModInt(*this) -= p; }
  constexpr ModInt operator*(const ModInt &p) { return ModInt(*this) *= p; }
  constexpr ModInt operator/(const ModInt &p) { return ModInt(*this) /= p; }
  constexpr bool operator==(const ModInt &p) { return x == p.x; }
  constexpr bool operator!=(const ModInt &p) { return x != p.x; }
  constexpr ModInt inverse() const {
    ll a = x, b = mod, u = 1, v = 0, t;
    while (b > 0) {
      t = a / b;
      swap(a -= t * b, b);
      swap(u -= t * v, v);
    }
    return ModInt(u);
  }
  constexpr ModInt pow(ll n) {
    ModInt ret(1), mul(x);
    while (n > 0) {
      if (n & 1)
        ret *= mul;
      mul *= mul;
      n >>= 1;
    }
    return ret;
  }
  friend ostream &operator<<(ostream &os, const ModInt &p) {
    return os << p.x;
  }
  friend istream &operator>>(istream &is, ModInt &a) {
    ll t;
    is >> t;
    a = ModInt<mod>(t);
    return (is);
  }
};

using mint = ModInt<MOD>;
using vm = vector<mint>;
using vvm = vector<vm>;

constexpr int MAX_FAC = 200010;
mint fac[MAX_FAC], facinv[MAX_FAC];
void combInit() {
  fac[0] = mint(1);
  for (int i = 0; i < MAX_FAC - 1; i++) {
    fac[i + 1] = fac[i] * (i + 1);
  }
  facinv[MAX_FAC - 1] = fac[MAX_FAC - 1].inverse();
  for (int i = MAX_FAC - 2; i >= 0; i--) {
    facinv[i] = facinv[i + 1] * (i + 1);
  }
}
mint comb(const ll a, const ll b) {
  assert(a < MAX_FAC);
  assert(b < MAX_FAC);
  if (a < 0 || b < 0 || b > a) {
    return mint(0);
  }
  mint ret(1);
  ret *= fac[a];
  ret *= facinv[b];
  ret *= facinv[a - b];
  return ret;
}
mint multicomb(const ll a, const ll b) {
  return comb(a + b - 1, b);
}

template <typename T>
struct Edge {
  int from, to;
  T cost;
  int id;
  Edge(int from_, int to_, T cost_, int id_) : from(from_), to(to_), cost(cost_), id(id_) {}
  Edge(int from_, int to_, T cost_) : from(from_), to(to_), cost(cost_) {}
  Edge(int from_, int to_) : from(from_), to(to_), cost(1) {}
  bool operator<(const Edge<T> &r) {
    return cost < r.cost;
  }
};
template <typename T>
ostream &operator<<(ostream &os, Edge<T> edge) {
  os << edge.from << " -> " << edge.to << " (" << edge.cost << ")";
  return os;
}

// グラフテンプレート(隣接リスト)
template <typename E = Edge<ll>>
struct GraphL {
  // 頂点数、辺数
  int n, m;
  // 隣接リスト
  vector<vector<E>> adj;
  GraphL(int n_)
      : n(n_), m(0), adj(n_) {}

  template <typename... Args>
  void add_edge(int from, int to, Args... args) {
    adj[from].emplace_back(from, to, args...);
    m++;
  }
  vector<E> &operator[](int i) { return adj[i]; }
};
template <typename E = Edge<ll>>
ostream &operator<<(ostream &os, GraphL<E> graph) {
  os << "V = " << graph.n << ", E = " << graph.m << "\n";
  for (const auto &ev : graph.adj) {
    for (const auto &e : ev) {
      os << e << "\n";
    }
  }
  return os;
}

vm dp(200010, 1);

// 深さ優先探索
template <typename E>
mint dfs(GraphL<E> &graph) {
  mint ret = 1;
  vector<bool> visited(graph.n, false);
  auto dfs_in = [&](auto &Self, int node) -> void {
    visited[node] = true;
    for (auto &&e : graph.adj[node]) {
      if (!visited[e.to]) {
        Self(Self, e.to);
        dp[node] *= dp[e.to] + 1;
      }
    }
    dump(node, dp[node]);
  };
  for (int i = 0; i < graph.n; i++) {
    if (!visited[i]) {
      dfs_in(dfs_in, i);
      ret *= dp[i] + 1;
      dump(i, ret);
    }
  }
  return ret;
}


template <typename T, typename E, typename F, typename G, typename H, typename P>
struct LazySegmentTree {
  int N;
  T T_identity;
  E E_identity;
  F merge;      // (T, T) -> T
  G operate;    // (T, E) -> T
  H merge_op;   // (E, E) -> E
  P operate_ex; // (E, int) -> E
  vector<T> node;
  vector<T> lazy;
  LazySegmentTree(F mg, G op, H m_op, P op_ex, T tid, E eid,
      const vector<T> &vec = vector<T>())
      : T_identity(tid), E_identity(eid), merge(mg), operate(op),
        merge_op(m_op), operate_ex(op_ex) {
    build(vec);
  }
  void build(const vector<T> &vec) {
    int sz = vec.size();
    N = 1;
    while (N < sz) {
      N <<= 1;
    }
    node.resize(2 * N - 1, T_identity);
    lazy.resize(2 * N - 1, E_identity);
    for (int i = 0; i < sz; i++) {
      node[i + N - 1] = vec[i];
    }
    for (int i = N - 2; i >= 0; i--) {
      node[i] = merge(node[2 * i + 1], node[2 * i + 2]);
    }
  }
  inline void eval(int len, int k) {
    if (lazy[k] == E_identity) {
      return;
    }
    if (k * 2 + 1 < N * 2 - 1) {
      lazy[k * 2 + 1] = merge_op(lazy[k * 2 + 1], lazy[k]);
      lazy[k * 2 + 2] = merge_op(lazy[k * 2 + 2], lazy[k]);
    }
    node[k] = operate(node[k], operate_ex(lazy[k], len));
    lazy[k] = E_identity;
  }
  T update(int a, int b, E x, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a || b <= l) {
      return node[k];
    }
    if (a <= l && r <= b) {
      lazy[k] = merge_op(lazy[k], x);
      return operate(node[k], operate_ex(lazy[k], r - l));
    }
    return node[k] = merge(update(a, b, x, k * 2 + 1, l, (l + r) / 2),
                           update(a, b, x, k * 2 + 2, (l + r) / 2, r));
  }
  T update(int a, int b, E x) {
    return update(a, b, x, 0, 0, N);
  }
  T query(int a, int b, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a || b <= l) {
      return T_identity;
    }
    if (a <= l && r <= b) {
      return node[k];
    }
    T vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
    T vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
    return merge(vl, vr);
  }
  T query(int a, int b) {
    return query(a, b, 0, 0, N);
  }
  T operator[](const int idx) {
    return query(idx, idx+1, 0, 0, N);
  }
};

// F, G, H
auto st_min = [](ll a, ll b) { return min(a, b); };
auto st_max = [](ll a, ll b) { return max(a, b); };
auto st_sum = [](ll a, ll b) { return a + b; };
auto st_upd = [](ll a, ll b) { return b == -INF ? a : b; };
auto st_upd0 = [](ll a, ll b) { return b == 0 ? a : b; };

// P
auto st_mul = [](ll a, ll b) { return a * b; };
auto st_no = [](ll a, ll) { return a; };

/*

// range add / range sum
LazySegmentTree<ll, ll, decltype(st_sum),
  decltype(st_sum), decltype(st_sum), decltype(st_mul)>
seg(st_sum, st_sum, st_sum, st_mul, 0, 0, vll(n, 0));

// range upd / range sum
LazySegmentTree<ll, ll, decltype(st_sum),
  decltype(st_upd), decltype(st_upd), decltype(st_no)>
seg(st_sum, st_upd, st_upd, st_no, 0, 0, vll(n, 0));

// range upd / range min
LazySegmentTree<ll, ll, decltype(st_min),
  decltype(st_upd), decltype(st_upd), decltype(st_no)>
seg(st_min, st_upd, st_upd, st_no, INF, INF, vector<ll>(n, INF));

// range upd / range max
LazySegmentTree<ll, ll, decltype(st_max),
  decltype(st_upd), decltype(st_upd), decltype(st_no)>
seg(st_max, st_upd, st_upd, st_no, -INF, -INF, vector<ll>(n, -INF));

// range add / range min
LazySegmentTree<ll, ll, decltype(st_min),
  decltype(st_sum), decltype(st_sum), decltype(st_no)>
seg(st_min, st_sum, st_sum, st_no, INF, 0, a);

// range upd / range sum
LazySegmentTree<ll, ll, decltype(st_sum),
  decltype(st_upd), decltype(st_upd), decltype(st_mul)>
seg(st_sum, st_upd, st_upd, st_mul, 0, -INF, vector<ll>(n, 0));

*/

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n;
  cin >> n;
  vll x(n), d(n);
  rep(i, n){
    cin >> x[i] >> d[i];
  }
  pairSort(x, d);
  GraphL<> g(n);
  dump(x, d);
  // range upd / range min
  LazySegmentTree<ll, ll, decltype(st_min),
    decltype(st_upd), decltype(st_upd), decltype(st_no)>
  seg(st_min, st_upd, st_upd, st_no, INF, INF, vector<ll>(n, INF));
  rep(i, n-1){
    ll j = lower_bound(ALL(x), x[i]+d[i]) - x.begin();
    dump(i, j);
    seg.update(i+1, j, i);
  }
  rep(i, n){
    if(seg.query(i, i+1) < INF) g.add_edge(seg.query(i, i+1), i);
  }
  dump(g);
  print(dfs(g));
}


Measured memory_bytes: 32840