#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

int p;
long long fen[404040];

void upd(int pos, int x)
{
	for(++pos; pos <= p; pos += pos & -pos)
		fen[pos] += x;
}

long long qry(int pos)
{
	long long ret = 0;
	for(; pos; pos &= pos - 1)
		ret += fen[pos];
	return ret;
}

long long solve()
{
	// cout << "ok" << endl;
	int s = 0, e = p;
	long long sum = qry(p);
	while(s + 1 < e)
	{
		int mid = s + e >> 1;
		if(qry(mid) <= sum / 2) s = mid; 
		else e = mid; 
	}
	// cout << sum << ' ' << qry(s) << ' ' << qry(e) << endl;
	return min(sum - 2 * qry(s), 2 * qry(e) - sum);
}

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);
	
	int n; cin >> n; --n;
	p = 1;
	while(p <= n) p <<= 1;
	int A[n];
	for(int i = 0; i < n; ++i) cin >> A[i], upd(i, A[i]);
	
	cout << solve() << '\n';
	int T; cin >> T;
	while(T--)
	{
		int pos, x; cin >> pos >> x; --pos;
		upd(pos, x - A[pos]);
		A[pos] = x;
		cout << solve() << '\n';
	}
}