#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;



template<class T, T (*add)(T, T), T (*zero)(), T (*mul)(T, T), T (*one)(), int N>
struct Mat : array<array<T, N>, N> {
  using M = Mat<T, add, zero, mul, one, N>;
  void make_identity() {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      (*this)[i][i] = one();
    }
  }
  M& operator+=(const M& rhs) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        (*this)[i][j] = add((*this)[i][j], rhs[i][j]);
      }
    }
    return *this;
  }
  M& operator*=(const M& rhs) {
    static M temp;
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        temp[i][j] = zero();
      }
    }
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        for (int k = 0; k < N; k++) {
          temp[i][k] = add(temp[i][k], mul((*this)[i][j], rhs[j][k]));
        }
      }
    }
    *this = temp;
    return *this;
  }
  template <class I>
  void inplace_pow(I k) {
    assert(k >= 0);
    static M temp;
    temp = *this;
    make_identity();
    while (k) {
      if (k & 1) *this *= temp;
      k >>= 1;
      if (k) temp *= temp;
    }
  }
  friend ostream& operator<<(ostream& os, const M& A) {
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < N; j++) {
        os << A[i][j] << " \n"[j + 1 == N];
      }
    }
    return os;
  }
};

// tropical semiring
constexpr ll INF = 1002003004005006007;
ll add(ll x, ll y) { return max(x, y); }
ll zero() { return -INF; }
ll mul(ll x, ll y) { return x + y; }
ll one() { return 0; }

using S = Mat<ll, add, zero, mul, one, 3>;

S op(S x, S y) {
  x *= y;
  return x;
}

S e() {
  S t;
  t.make_identity();
  return t;
}


} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VL cuts{0};

  vector<P> ab(n);
  {
    ll now = 0;
    for(auto& [a, b] : ab) {
      cin >> a >> b;
      now += b;
      cuts.emplace_back(now);
    }
  }
  int q;
  cin >> q;
  vector<tuple<int, int, int>> queries(q);
  for(auto& [t, x, y] : queries) {
    cin >> t >> x >> y;
    if (t == 1) {
      x--;
      cuts.emplace_back(x);
      cuts.emplace_back(x + 1);
    } else {
      x--;
      cuts.emplace_back(x);
      cuts.emplace_back(y);
    }
  }
  sort(all(cuts));
  cuts.erase(unique(all(cuts)), cuts.end());
  int sz = int(cuts.size()) - 1;
  vector<S> init(sz);
  {
    int ptr = 0;
    ll now = 0;
    for(auto [a, b] : ab) {
      S t;
      t[0] = {a, zero(), a};
      t[1] = {a, one(), a};
      t[2] = {zero(), zero(), one()};
      ll nxt = now + b;
      while(cuts[ptr] != nxt) {
        ll k = cuts[ptr + 1] - cuts[ptr];
        S tk = t;
        tk.inplace_pow(k);
        init[ptr] = tk;
        ptr++;
      }
      now = nxt;
    }
  }
  segtree<S, op, e> seg(init);
  // rep(i, sz + 1) cout << cuts[i] << " \n"[i + 1 == sz + 1];
  for(auto [t, x, y] : queries) {
    if (t == 1) {
      int i = lower_bound(all(cuts), x) - cuts.begin();
      S t;
      t[0] = {y, zero(), y};
      t[1] = {y, one(), y};
      t[2] = {zero(), zero(), one()};
      seg.set(i, t);
    } else {
      int l = lower_bound(all(cuts), x) - cuts.begin(), r = lower_bound(all(cuts), y) - cuts.begin();
      auto t = seg.prod(l, r);
      cout << t[1][2] << '\n';
    }
  }
}