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

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A,size_t N,typename T>void Fill(A(&array)[N],const T &val){fill((T*)array, (T*)(array+N), val);}
const int inf=INT_MAX/2; const ll INF=LLONG_MAX/2;
//template end



int main(){
    int n; scanf("%d",&n);
    vector<int> a(n);
    rep(i,0,n)scanf("%d",&a[i]);
    int maxx=0,sum=0;
    rep(i,0,n-23){
        sum=0;
        rep(j,i,i+24)sum+=a[j];
        chmax(maxx,sum);
    }
    int q,t,v,rb; scanf("%d",&q);
    rep(rot,0,q){
        scanf("%d%d",&t,&v); t--;
        a[t]=v;
        rep(i,max(0,t-24),t+1){
            rb=i+24;
            if(i<0||rb>n)continue;
            sum=0;
            rep(j,i,rb)sum+=a[j];
            chmax(maxx,sum);
        }
        printf("%d\n",maxx);
    }
    return 0;
}