#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

int n,q;
int a[200010];
const int m=24;

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin>>n;
  rep(i,n)cin>>a[i];

  int mx=0;
  rep(i,n-m+1){
    int sum=0;
    rep(j,m){
      sum+=a[i+j];
    }
    maxch(mx,sum);
  }

  cin>>q;
  rep(_,q){
    int t,v;
    cin>>t>>v;
    t--;
    a[t]=v;
    repl(i,max(0,t-m),min(n-m+1,t+1)){
      ll sum=0;
      rep(j,m){
        sum+=a[i+j];
      }
      maxch(mx,sum);
    }
    cout<<mx<<'\n';
  }

  return 0;
}