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

using namespace std;
typedef long long ll;

template<typename T>
struct BinaryIndexedTree {
    vector<T> data;

    BinaryIndexedTree(int sz) {
        data.assign(++sz, 0);
    }

    T sum(int k) {
        T ret = 0;
        for (++k; k > 0; k -= k & -k) ret += data[k];
        return (ret);
    }

    void add(int k, T x) {
        for (++k; k < data.size(); k += k & -k) data[k] += x;
    }
};

int main() {
    int n;
    cin >> n;
    BinaryIndexedTree<int> bit(n + 1);
    for (int i = 0; i < n; i++) {
        int tmp;
        cin >> tmp;
        bit.add(i + 1, tmp);
    }
    int ret = 0;
    for (int i = 24; i <= n; i++)ret = max(ret, bit.sum(i) - bit.sum(i - 24));

    int q;
    cin >> q;
    for (int i = 0; i < q; i++) {
        int t, v;
        cin >> t >> v;
        int plus = v - (bit.sum(t) - bit.sum(t - 1));
        bit.add(t, plus);
        for (int finish = t; finish < t + 24 && finish <= n; finish++) {
            if (finish < 24)continue;
            ret = max(ret, bit.sum(finish) - bit.sum(finish - 24));
        }

        cout << ret << endl;
    }
    return 0;
}