#include <iostream>
#include <vector>
#include <math.h>
using namespace std;

typedef long long LL;

int main()
{
    int N;
    cin >> N;

    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }

    vector<int> accum(N-23, 0);
    for (int i = 0; i < 24; ++i) {
        accum[0] += A[i];
    }
    int maxAccum = accum[0];
    for (int i = 1; i + 23 < N; ++i) {
        accum[i] = accum[i-1] + A[i + 23] - A[i-1];
        maxAccum = max(maxAccum, accum[i]);
    }

    int Q;
    cin >> Q;

    for (int i = 0; i < Q; ++i) {
        int T, V;
        cin >> T >> V;
        --T;

        int diff = V - A[T];
        A[T] = V;
        for (int j = max(0, T-23); j <= min(T, N-24); ++j) {
            accum[j] += diff;    
            maxAccum = max(maxAccum, accum[j]);
        }
        cout << maxAccum << endl;
    }

    return 0;
}