#include <bits/stdc++.h>
#ifdef LOCAL_DEBUG
#define DEBUG 1
#define CERR if(DEBUG) cerr
#define MACRO(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,NAME,...) NAME
#define pr(...) CERR<<MACRO(__VA_ARGS__,pr10,pr9,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__)<<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
#define pr9(a,b,c,d,e,f,g,h,i) pr1(a)<<pr8(b,c,d,e,f,g,h,i)
#define pr10(a,b,c,d,e,f,g,h,i,j) pr1(a)<<pr9(b,c,d,e,f,g,h,i,j)
#define prArr(a){CERR<<(#a)<<"={";int i=0;for(auto t:(a))CERR<<(i++?", ":"")<<t;CERR<<"}"<<endl;}
#else
#define DEBUG 0
#define pr(...)
#define prArr(a)
#endif
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<60)+1e9; // ~ 1.15 * 1e18
const Int mod = 998244353;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
//INSERT ABOVE HERE

template <typename T>
class Compress{
public:
  vector<T> X;
  bool ok;
  Compress():ok(false){};

  Int size(){assert(ok); return X.size();}
  void add(T a){ok = false; X.push_back(a); X.push_back(a-1); X.push_back(a+1);}
  void add(const vector<T> a){for(T x:a) add(x);}
  //void add(const vector<T> &a){for(T x:a) add(x);}

  void build(){
    ok = true;
    sort(X.begin(),X.end());
    X.erase(unique(X.begin(),X.end()),X.end());
  }

  Int getL(T x){assert(ok); return lower_bound(X.begin(),X.end(),x) - X.begin();}
  Int getU(T x){assert(ok); return upper_bound(X.begin(),X.end(),x) - X.begin();}
};


template<typename D, Int toMaxQuery, Int useAssert = 1>
class RMQ{
public :
  struct T{ //遅延データ
    Int type; //0 - empty, 1 - update, 2 - ifUpdate
    D value;
    T():type(0){}
    T(Int type, D value):type(type), value(value){}
  };

  Int n, n_;
  D initD;        //datの初期値
  D returnD;      //範囲外の時に返す値
  vector<D> dat;
  vector<T> td;

  RMQ(){n=-1;}
  RMQ(Int n_, D initD):n_(n_), initD(initD), returnD(initD){
    n=1;
    while(n<n_)n *= 2;
    td.resize(2*n-1, T());
    dat.resize(2*n-1, initD);
  }

  //目的データのマージ
  inline D mergeD(D l, D r){return toMaxQuery? max(l, r):min(l, r);}

  //遅延データのマージ
  inline T mergeT(const T &from,const T &to){
    if(to.type == 0) return from;
    if(from.type == 0) return to; //from-empty
    if(to.type == 1) return to; //to-update;
    if(to.type == 2) return T(from.type, mergeD(from.value, to.value)); //to-ifupdate
    if(useAssert) assert(0);
    return T();
  }

  //目的データに遅延データを反映
  inline void apply(D &a, const T &b){
    if(b.type == 0) return;
    if(b.type == 1) a = b.value; //update
    else a = mergeD(a, b.value); // if-update
  }

  D dfs(Int a, Int b,const T x, Int k, Int l, Int r){
    if(r <= a || b <= l) return x.type == 0? returnD : dat[k];
    if(a <= l && r <= b){
      td[k] = mergeT(td[k], x);
      apply(dat[k], x);
      return dat[k];
    }
    Int kl = k * 2 + 1, kr = k * 2 + 2;
    { //遅延を子に反映
      td[kl] = mergeT(td[kl], td[k]);
      td[kr] = mergeT(td[kr], td[k]);
      apply(dat[kl], td[k]);
      apply(dat[kr], td[k]);
      td[k] = T();
    }
    D vl = dfs(a, b, x, kl, l, (l+r)/2);
    D vr = dfs(a, b, x, kr, (l+r)/2, r);
    return x.type == 0? mergeD(vl,vr) : (dat[k] = mergeD(vl, vr));
  }

  //[l,r)の値をxに変更　update(l,r,x)
  void update(Int l,Int r, D x){
    if(useAssert) assert(l <= r), assert(l <= n && r <= n), assert(l >= 0 && r >= 0);
    dfs(l, r,  T(1, x), 0, 0, n);
  }

  //[l,r)の値をもしもxの方が小さければ変更　ifupdate(l,r,x)
  //toMaxのときは[l,r)の値をもしもxの方が大きければ変更　ifupdate(l,r,x)
  void ifupdate(Int l,Int r, D x){
    if(useAssert) assert(l <= r), assert(l <= n && r <= n), assert(l >= 0 && r >= 0);
    dfs(l, r,  T(2, x), 0, 0, n);
  }

  //[l,r)の最小値を得る　get(l,r);
  D get(Int l,Int r){
    if(useAssert) assert(l <= r), assert(l <= n && r <= n), assert(l >= 0 && r >= 0);
    return dfs(l, r, T(0, initD), 0 , 0 ,n);
  }
};


signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int N;
  cin>>N;
  vector<P> A(N);
  cin>>A;
  sort(A.begin(), A.end());

  vector<Int>  X(N);
  for(Int i=0;i<N;i++){
    Int x, d; tie(x, d) = A[i];
    X[i] = x;
  }

  Compress <Int> cmpX;
  cmpX.add(X); cmpX.build();

  RMQ<Int, 1> seg(cmpX.size(), -INF);
  pr(cmpX.X);
  for(Int i=N-1;i>=0;i--){
    Int x, d; tie(x, d) = A[i];
    Int l = cmpX.getL(x);
    Int r = cmpX.getL(x + d);
    Int R = max(l, seg.get(l, r));
    pr(i, x, d, l, r, R);
    seg.ifupdate(l, l + 1, R);
  }

  vector<Int> used(N + 1), mem(N + 1);
  function<Int(Int)> dfs=[&](Int idx)->Int{
    if(idx == N) return 1;
    if(used[idx]++) return mem[idx];
    Int x, d; tie(x, d) = A[idx];

    //起爆
    Int R = seg.get(cmpX.getL(x), cmpX.getL(x) + 1);
    int i = lower_bound(X.begin(), X.end(), cmpX.X[R]) - X.begin();
    Int a = dfs(i + 1);

    //残す
    Int b = dfs(idx + 1);
    Int res = (a + b) % mod;
    return mem[idx] = res;
  };

  Int ans = dfs(0);
  cout<<ans<<endl;
  return 0;
}


Measured memory_bytes: 91724