# -*- coding: utf-8 -*-
from math import sqrt
def inpl(): return list(map(int, input().split()))

class SegmentTree:
    
    def __init__(self, N, init_node=None):
        self.size = 2**int.bit_length(N)
        self.node = [0]*(2*self.size-1)
        if not init_node is None:
            for i in range(N):
                self.node[i+self.size-1] = init_node[i]
        for i in range(self.size-2, -1, -1):
            self.node[i] = max(self.node[2*i+1], self.node[2*i+2])

    def add(self, x, val):
        x += self.size - 1
        self.node[x] += val
        while x:
            x = (x-1)//2
            self.node[x] = max(self.node[2*x+1], self.node[2*x+2])

class LazySegmentTree:
    
    def __init__(self, N, init_node=None):
        self.size = 2**int.bit_length(N)
        self.node = [0]*(2*self.size-1)
        if not init_node is None:
            for i in range(N):
                self.node[i+self.size-1] = init_node[i]
            for i in range(self.size-2, -1, -1):
                self.node[i] = max(self.node[2*i+1], self.node[2*i+2])
        self.lazy = [0]*(2*self.size-1)

    def eval(self, k, l, r):
        if self.lazy[k]:
            self.node[k] += self.lazy[k]
            if r-l-1:
                self.lazy[2*k+1] += self.lazy[k]
                self.lazy[2*k+2] += self.lazy[k]
            self.lazy[k] = 0

    def add(self, a, b, val, k=None, l=None, r=None):
        if k is None:
            k = 0
            l = 0
            r = self.size
        self.eval(k, l, r)
        if (b <= l) or (r <= a):
            return
        
        if (a<=l) and (r<=b):
            self.lazy[k] += val
            self.eval(k, l, r)
        else:
            self.add(a, b, val, 2*k+1, l, (l+r)//2)
            self.add(a, b, val, 2*k+2, (l+r)//2, r)
            self.node[k] = max(self.node[2*k+1], self.node[2*k+2])



N = int(input())
A = [0] * 23 + inpl() + [0]*23

s = sum(A[:24])
X = [0]*(N + 46)
for i in range(24):
    X[i] = A[23]*1


s = A[23]*1
for i in range(24, N+46):
    s += A[i] - A[i-24]
    X[i] = s


seg = LazySegmentTree(len(X), X)
for _ in range(int(input())):
    t, v = inpl()
    t += 22
    d = v - A[t]
    A[t] = v
    seg.add(t-23, t+24, d)
    print(seg.node[0])