#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
typedef long long ll;

pair<pair<ll,ll>,pair<ll,ll>> e(){
  return make_pair(make_pair(0LL,-10000000000LL),make_pair(-10000000000LL,-10000000000LL));
}

pair<pair<ll,ll>,pair<ll,ll>> op(pair<pair<ll,ll>,pair<ll,ll>> a,pair<pair<ll,ll>,pair<ll,ll>> b){
  if(b==e()){
    return a;
  }if(a==e()){
    return b;
  }
  return make_pair(make_pair(a.first.first+b.first.first,max(max(a.first.second,b.first.second),max(a.second.second+b.second.first,max(max(a.second.second+b.first.first,b.second.second),max(a.first.first+b.second.first,a.second.first))))),make_pair(max(a.first.first+b.second.first,a.second.first),max(a.second.second+b.first.first,b.second.second)));
}

int main(){
  int N;
  cin>>N;
  vector<pair<ll,ll>> P(N);
  for(int i=0;i<N;i++){
    cin>>P[i].first>>P[i].second;
  }
  vector<pair<ll,ll>> S(0);
  ll ccccc=0;
  for(int i=0;i<N;i++){
    ccccc+=P[i].second;
    if(i==N-1){
      S.push_back(make_pair(ccccc,0));
    }else{
      S.push_back(make_pair(ccccc,P[i+1].first));
    }
  }
  int Q;
  cin>>Q;
  vector<pair<int,pair<ll,ll>>> que(Q);
  for(int i=0;i<Q;i++){
    cin>>que[i].first>>que[i].second.first>>que[i].second.second;
    que[i].second.first--;
    if(que[i].first==1){
      S.push_back(make_pair(que[i].second.first,-1000000));
      S.push_back(make_pair(que[i].second.first+1,-1000000));
    }else{
      S.push_back(make_pair(que[i].second.first,-1000000));
      S.push_back(make_pair(que[i].second.second,-1000000));
    }
  }
  sort(S.begin(),S.end());
  ll atk=P[0].first;
  ccccc=0;
  int lllll=0;
  map<ll,int> M;
  M[0]=0;
  vector<pair<pair<ll,ll>,pair<ll,ll>>> Z(0);
  for(int i=0;i<(int)(S.size());i++){
    if(ccccc==S[i].first){
      if(-100000<=S[i].second){
        atk=S[i].second;
      }
      continue;
    }else{
      lllll++;
      Z.push_back(make_pair(make_pair((S[i].first-ccccc)*atk,max(atk,(S[i].first-ccccc)*atk)),make_pair(max(atk,(S[i].first-ccccc)*atk),max(atk,(S[i].first-ccccc)*atk))));
      ccccc=S[i].first;
      M[ccccc]=lllll;
      if(-100000<=S[i].second){
        atk=S[i].second;
      }
    }
  }
  segtree<pair<pair<ll,ll>,pair<ll,ll>>,op,e> seg(Z);
  for(int i=0;i<Q;i++){
    if(que[i].first==1){
      ll x=M[que[i].second.first];
      ll y=que[i].second.second;
      seg.set(x,make_pair(make_pair(y,y),make_pair(y,y)));
    }else{
      ll l=M[que[i].second.first];
      ll r=M[que[i].second.second];
      pair<ll,ll> z=seg.prod(l,r).first;
      cout<<z.second<<endl;
    }
  }
}