#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define FORR(i, a, b) for(int i = (a); i > (b); --i)
#define REP(i, n) for(int i = 0; i < (n); ++i)
#define REPR(i, n) for(int i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) (64 - __builtin_clzll(x))
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define sz(s) (ll) s.size()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define precise(x) cout << fixed << setprecision(x)
#define PERM(c)                                                                \
    sort(All(c));                                                              \
    for(bool cp = true; cp; cp = next_permutation(All(c)))
#define COMB(n, k)                                                             \
    for(ll bit = (1LL << k) - 1; bit < (1LL << n); bit = next_combination(bit))
#define PERM2(n, k)                                                            \
    COMB(n, k) {                                                               \
        vector<int> sel;                                                       \
        for(int bitindex = 0; bitindex < n; bitindex++)                        \
            if(bit >> bitindex & 1) sel.emplace_back(bitindex);                \
        PERM(sel) { Printv(sel); }                                             \
    }
#define MKORDER(n)                                                             \
    vector<int> od(n);                                                         \
    iota(All(od), 0LL);

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
template <class Head> inline void COUT(Head &&head) { cout << (head) << "\n"; }
template <class Head, class... Tail>
inline void COUT(Head &&head, Tail &&... tail) {
    cout << (head) << " ";
    COUT(forward<Tail>(tail)...);
}

#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    long long __VA_ARGS__;                                                     \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Printv(v)                                                              \
    {                                                                          \
        REP(hoge, v.size())                                                    \
        cout << v[hoge] << (hoge == v.size() - 1 ? "" : " ");                  \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

long long next_combination(long long sub) {
    long long x = sub & -sub, y = sub + x;
    return (((sub & ~y) / x) >> 1) | y;
}
template <class T> inline bool chmax(T &a, const T &b) {
    if(a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
    if(a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// generic lambdas
template <typename first>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) &&                                                     \
    (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
    static inline constexpr decltype(auto)
    fix(first &&f) noexcept {
    return [f = std::forward<first>(f)](auto &&... args) {
        return f(f, std::forward<decltype(args)>(args)...);
    };
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
// const int MOD = 1e9 + 7;
const int MOD = 998244353;
const ll LINF = 1e18;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793230
#define EPS 1e-7

// 1000000007 で割ったあまりを扱う構造体
class mint {
  public:
    static long long MOD;
    long long val;
    mint(long long v = 0) noexcept : val(v % MOD) {
        if(val < 0) v += MOD;
    }
    int getmod() { return MOD; }
    mint operator-() const noexcept { return val ? MOD - val : 0; }
    mint operator+(const mint &r) const noexcept { return mint(*this) += r; }
    mint operator-(const mint &r) const noexcept { return mint(*this) -= r; }
    mint operator*(const mint &r) const noexcept { return mint(*this) *= r; }
    mint operator/(const mint &r) const noexcept { return mint(*this) /= r; }
    mint &operator+=(const mint &r) noexcept {
        val += r.val;
        val = (val + MOD) % MOD;
        return *this;
    }
    mint &operator-=(const mint &r) noexcept {
        val -= r.val;
        val = (val + MOD) % MOD;
        return *this;
    }
    mint &operator*=(const mint &r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    mint &operator/=(const mint &r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while(b) {
            long long t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        val = val * u % MOD;
        if(val < 0) val += MOD;
        return *this;
    }
    bool operator==(const mint &r) const noexcept { return this->val == r.val; }
    bool operator!=(const mint &r) const noexcept { return this->val != r.val; }
    friend ostream &operator<<(ostream &os, const mint &x) noexcept {
        return os << x.val;
    }
    friend istream &operator>>(istream &is, mint &x) noexcept {
        return is >> x.val;
    }
    friend mint modpow(const mint &a, long long n) noexcept {
        if(n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if(n & 1) t = t * a;
        return t;
    }
};
ll mint::MOD = 998244353;

//遅延seg2
template <typename T, typename E> struct SegmentTree {
    using F = function<T(T, T)>;
    using G = function<T(T, E)>;
    using H = function<E(E, E)>;
    int n, height;
    F f;
    G g;
    H h;
    T ti;
    E ei;
    vector<T> dat;
    vector<E> laz;
    SegmentTree(F f, G g, H h, T ti, E ei) : f(f), g(g), h(h), ti(ti), ei(ei) {}

    void init(int n_) {
        n = 1;
        height = 0;
        while(n < n_) n <<= 1, height++;
        dat.assign(2 * n, ti);
        laz.assign(2 * n, ei);
    }
    void build(const vector<T> &v) {
        int n_ = v.size();
        init(n_);
        for(int i = 0; i < n_; i++) dat[n + i] = v[i];
        for(int i = n - 1; i; i--)
            dat[i] = f(dat[(i << 1) | 0], dat[(i << 1) | 1]);
    }
    inline T reflect(int k) {
        return laz[k] == ei ? dat[k] : g(dat[k], laz[k]);
    }
    inline void eval(int k) {
        if(laz[k] == ei) return;
        laz[(k << 1) | 0] = h(laz[(k << 1) | 0], laz[k]);
        laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);
        dat[k] = reflect(k);
        laz[k] = ei;
    }
    inline void thrust(int k) {
        for(int i = height; i; i--) eval(k >> i);
    }
    inline void recalc(int k) {
        while(k >>= 1) dat[k] = f(reflect((k << 1) | 0), reflect((k << 1) | 1));
    }
    void update(int a, int b, E x) {
        if(a >= b) return;
        thrust(a += n);
        thrust(b += n - 1);
        for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if(l & 1) laz[l] = h(laz[l], x), l++;
            if(r & 1) --r, laz[r] = h(laz[r], x);
        }
        recalc(a);
        recalc(b);
    }
    void set_val(int a, T x) {
        thrust(a += n);
        dat[a] = x;
        laz[a] = ei;
        recalc(a);
    }
    T query(int a, int b) {
        if(a >= b) return ti;
        thrust(a += n);
        thrust(b += n - 1);
        T vl = ti, vr = ti;
        for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
            if(l & 1) vl = f(vl, reflect(l++));
            if(r & 1) vr = f(reflect(--r), vr);
        }
        return f(vl, vr);
    }
};

ll e1 = -LINF, e2 = -LINF;
auto f = [](ll a, ll b) { return max(a, b); };
auto g = [](ll a, ll b) { return b; };
auto h = [](ll a, ll b) { return b; };
SegmentTree<ll, ll> seg(f, g, h, e1, e2);

mint dp[200002][2];

signed main() {
    cinfast();
    LCIN(N);
    VPL XD;
    REP(i, N) {
        LCIN(x, d);
        XD.emplace_back(x, d);
    }
    sort(All(XD));
    VVL G(N);
    VL deg(N);
    VPL xd;
    REP(i, N) { xd.emplace_back(XD[i].fi + XD[i].se, i); }
    seg.build(VL(N, -1));
    sort(All(xd));
    REP(i, N) {
        ll idx = upper_bound(All(xd), PL(XD[i].fi, LINF)) - xd.begin();
        ll par = seg.query(idx, N);
        ll ch =
            lower_bound(All(xd), PL(XD[i].fi + XD[i].se, -LINF)) - xd.begin();
        seg.update(ch, ch + 1, i);
        if(par <= -1) continue;
        G[par].emplace_back(i);
        deg[i]++;
    }
    auto dfs = fix([&](auto f, ll now, ll par) -> void {
        dp[now][0] = 1;
        dp[now][1] = 1;
        FOREACH(to, G[now]) {
            if(to == par) continue;
            f(f, to, now);
            dp[now][0] *= dp[to][0];
            dp[now][1] *= dp[to][1] + dp[to][0];
        }
    });
    mint ans = 1;
    REP(i, N) {
        if(deg[i]) continue;
        dfs(i, -1);
        ans *= dp[i][0] + dp[i][1];
    }
    COUT(ans);
}

Measured memory_bytes: 38380