#include <iostream>
#include <algorithm>
#include <vector>


#define REP(i, n) for(int (i) = 0; (i) < (n); ++(i))
#define ALL(TheArray) TheArray.begin(), TheArray.end()

template <class T> inline T& chmax(T& a, T b){return (a < b) ? a = b : a;}
template <class T> inline T& chmin(T& a, T b){return (a > b) ? a = b : a;}

using lli = long long int;



std::vector<int> A, S;

int main(void){
    int n; scanf("%d", &n);
    A.resize(n); REP(i, n) scanf("%d", &A[i]);

    S.resize(n-23);
    int s = 0; REP(i, 24) s += A[i];
    REP(i, n-23){
        S[i] = s;
        if(i + 24 < n) s += A[i+24] - A[i];
    }
    int mx = -1;
    REP(i, n - 23) if(mx < S[i]) mx = S[i];

    int Q; scanf("%d", &Q);
    while(Q--){
        int t, v; scanf("%d%d", &t, &v); t--;
        int diff = v - A[t]; A[t] = v;
        REP(j, 24) if(0 <= t - j and t - j < n - 23){
            S[t-j] += diff;
            chmax(mx, S[t-j]);
        }
        printf("%d\n", mx);
    }
    return 0;
}