#include <iostream>
#include <queue>
#include <functional>
#include <algorithm>
#include <vector>
using namespace std;
#pragma warning (disable: 4996)

// 降水量が減少する場合にも正解できる解法

int N, Q, A[1 << 18], T[1 << 18], V[1 << 18];
priority_queue<pair<int, int>, vector<pair<int, int>>, less<pair<int, int>>> que;

int ranged(int cl, int cr) {
	int sum = 0;
	for (int i = cl; i <= cr; i++) sum += A[i];
	return sum;
}

int main() {
	scanf("%d", &N);
	for (int i = 1; i <= N; i++) scanf("%d", &A[i]);
	for (int i = 1; i <= N - 23; i++) que.push(make_pair(ranged(i, i + 23), i));

	scanf("%d", &Q);
	for (int i = 1; i <= Q; i++) {
		scanf("%d%d", &T[i], &V[i]);
		A[T[i]] = V[i];
		for (int j = T[i] - 23; j <= T[i]; j++) {
			if (j <= 0 || j + 23 > N) continue;
			que.push(make_pair(ranged(j, j + 23), j));
		}
		while (!que.empty()) {
			pair<int, int> val = que.top();
			int actual = ranged(val.second, val.second + 23);
			if (actual != val.first) que.pop();
			else break;
		}

		printf("%d\n", que.top());
	}
	return 0;
}