#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 123450
#endif

int N,M,Q;
int A[212345];

int query(int l, int r) {
    int ma = 0;
    int sum = 0;
    FOR(i,l,r) {
        sum += A[i];
        if (i >= l + 24) {
            sum -= A[i-24];
        }
        ma = max(ma, sum);
    }
    return ma;
}

void solve() {
    cin>>N;
    REP(i,N)cin>>A[i];
    cin>>Q;
    
    int ans = query(0, N);
    int T,V;
    REP(_,Q) {
        cin >> T >> V;
        T--;
        A[T] = V;
        ans = max(ans, query(max(0LL,T-24), min(N,T+25)));
        out("%lld\n", ans);
    }
}