#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n; cin >> n;
    vector<int> a(n);
    for (int &ai: a) cin >> ai;
    vector<int> sum(n - 23);    // sum[i] = a[i] + .. + a[i + 23]
    for (int i = 0; i < 24; i++) sum[0] += a[i];
    for (int i = 1; i < n - 23; i++) sum[i] = sum[i - 1] - a[i - 1] + a[i + 23];
    int ma = *max_element(sum.begin(), sum.end());
    int q; cin >> q;
    while (q--) {
        int t, v; cin >> t >> v; t--;
        int d = v - a[t]; a[t] = v;
        for (int i = 0; i < 24; i++) {
            if (t + i - 23 < 0 || t + i - 23 >= n - 23) continue;
            sum[t + i - 23] += d;
            ma = max(ma, sum[t + i - 23]);
        }
        cout << ma << endl;
    }
    return 0;
}