#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>

using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define R pair<pair<int, int>, pair<int, int>>
#define S(i,j,k,l) mkp(mkp(i,j),mkp(k,l))
#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)
#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)
#define req(n,i) for(int (i) = (n) - 1 ; (i) >= 0 ; (i)--)
#define range(i,v) for(auto& (i) : v)
#define mkp make_pair
#define mem(x,k) memset(x,k,sizeof(x))
#define vec vector
#define pb emplace_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==n-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define itn int
#define pri_que priority_queue
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define pppp(x,y,z,w) pb(S(x,y,z,w))
#define cyes cout<<"Yes\n"
#define cno cout<<"No\n"
#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; ll k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
void printh(H t) { printf("%lld %lld\n", t.fs, t.sc); }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
ll bitcount(ll x) {
	int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
	return sum;
}
/*constexpr int fn_ = 1000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
	if (!fact_[0]) {
		fact_[0] = 1; comp_[0] = 1;
		for (int i = 1; i < fn_; i++)
			fact_[i] = fact_[i - 1] * i % Mod;
		comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);
		for (int i = fn_ - 2; i > 0; i--)
			comp_[i] = comp_[i + 1] * (i + 1) % Mod;
	}
	if (x < y) return 0;
	return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//--------------------------------------------------------------
class RMQ {
#define H pair<int, int>
#define fs first
#define sc second
	int size, zero, m;
	H dat[500000];
public:
	void init(int a, int b) {
		size = a, zero = b;
		m = 1;
		while (m < size) m *= 2;
		for (int i = 0; i < 500000; i++) dat[i] = H{ zero,zero };
	}
	int query(int a, int b) {
		return query_(0, a, b, 0, m);
	}//0-indexed
	void update(int a, int b, int x) {
		update_(0, a, b, 0, m, x);
	}//0-indexed
private:
	void eval(int i, int l, int r) {
		if (r - l > 1) {
			if (zero > 0) {
				dat[i * 2 + 1].sc = min(dat[i * 2 + 1].sc, dat[i].sc);
				dat[i * 2 + 2].sc = min(dat[i * 2 + 2].sc, dat[i].sc);
			}
			else {
				dat[i * 2 + 1].sc = max(dat[i * 2 + 1].sc, dat[i].sc);
				dat[i * 2 + 2].sc = max(dat[i * 2 + 2].sc, dat[i].sc);
			}
		}
		if (zero <= 0) dat[i].fs = max(dat[i].fs, dat[i].sc);
		else dat[i].fs = min(dat[i].fs, dat[i].sc);
		dat[i].sc = zero;
	}
	int query_(int i, int a, int b, int l, int r) {
		eval(i, l, r);
		if (r <= a || b <= l) return zero;
		if (a <= l && r <= b) return dat[i].fs;
		if (zero > 0) return min(query_(i * 2 + 1, a, b, l, (l + r) / 2), query_(i * 2 + 2, a, b, (l + r) / 2, r));
		else return max(query_(i * 2 + 1, a, b, l, (l + r) / 2), query_(i * 2 + 2, a, b, (l + r) / 2, r));
	}
	void update_(int i, int a, int b, int l, int r, int x) {
		eval(i, l, r);
		if (r <= a || b <= l) return;
		if (a <= l && r <= b) {
			dat[i].sc = x;
			eval(i, l, r);
			return;
		}
		update_(i * 2 + 1, a, b, l, (l + r) / 2, x);
		update_(i * 2 + 2, a, b, (l + r) / 2, r, x);
		if (zero > 0) dat[i].fs = min(dat[i * 2 + 1].fs, dat[i * 2 + 2].fs);
		else dat[i].fs = max(dat[i * 2 + 1].fs, dat[i * 2 + 2].fs);
	}
};//size, zero
int n;
vec<H>a;
vec<int>b;
int dp[300000];
int dp2[300000];
RMQ rmq;
signed main() {
	cin >> n;
	rep(i, n) {
		a.pb(readh());
		b.pb(a[i].fs);
	}
	sort(all(a)); sort(all(b));
	dp2[n - 1] = n - 1;
	rmq.init(n, -inf);
	rmq.update(n - 1, n, n - 1);
	for (int i = n - 2; i >= 0; i--) {
		int k = lower_bound(all(b), a[i].fs + a[i].sc) - b.begin() - 1;
		int g = rmq.query(i + 1, k + 1);
		if (g == -inf) dp2[i] = i;
		else dp2[i] = g;
		rmq.update(i, i + 1, dp2[i]);
	}
	dp[0] = 1;
	rep(i, n) {
		if (i > 0) (dp[i] += dp[i - 1]) %= Mod;
		(dp[dp2[i] + 1] += dp[i]) %= Mod;
	}
	int ans = 1;
	rep(i, n) (ans += dp[i]) %= Mod;
	cout << (ans + Mod) % Mod << endl;
}

Measured memory_bytes: 20204