#include <bits/stdc++.h>

using namespace std;

#define int long long
#define rep(i, s, e) for (int i = s; i <= e; ++i)
#define drep(i, s, e) for (int i = s; i >= e; --i)
#define file(a) freopen(#a".in", "r", stdin), freopen(#a".out", "w", stdout)
#define pv(a) cout << #a << " = " << a << endl
#define pa(a, l, r) cout << #a " : "; rep(_, l, r) cout << a[_] << ' '; cout << endl

const int P = 998244353;
const int i2 = (P + 1) / 2;

const int N = 1e5 + 10;
const int M = N * 40;
const int W = 1e14;

int read() {
  int x = 0, f = 1; char c = getchar();
  for (; c < '0' || c > '9'; c = getchar()) if (c == '-') f = -1;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  return x * f;
}

#define ls lson[u]
#define rs rson[u]
#define mid (l + r >> 1)

int s1(int l, int r) {
  return (l + r) % P * (r - l + 1) % P * i2 % P;
}

int tot, cnt[M], out[M], res[M], lson[M], rson[M];

int calc(int k, int u, int l, int r) {
  if (!k) return res[u];
  if (k + cnt[u] >= r - l + 1) return s1(l, r);
  if (k + cnt[ls] <= mid - l + 1) {
    return (calc(k, ls, l, mid) + res[rs]) % P;
  }
  else {
    int rest = k + cnt[ls] - (mid - l + 1);
    return (s1(l, mid) + calc(rest, rs, mid + 1, r)) % P;
  }
}

void maintain(int u, int l, int r) {
  int t = min(r - mid - cnt[rs], out[ls]);
  cnt[u] = cnt[ls] + cnt[rs] + t;
  out[u] = out[ls] - t + out[rs];
  res[u] = res[ls] + calc(min(out[ls], t), rs, mid + 1, r);
}

int modify(int p, int k, int u, int l, int r) {
  if (!u) u = ++ tot;
  if (l == r) {
    cnt[u] = min(k, 1ll), out[u] = k - cnt[u];
    res[u] = cnt[u] * l;
    return u;
  }
  if (p <= mid) ls = modify(p, k, ls, l, mid);
  else rs = modify(p, k, rs, mid + 1, r);
  return maintain(u, l, r), u;
}

#undef ls
#undef rs
#undef mid

int n;

signed main() {
  n = read(), tot = 1;
  rep(i, 1, n) {
    int p = read(), k = read();
    modify(p, k, 1, 1, W);
    printf("%lld\n", res[1]);
  }
  return 0;
}