import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def FI(): return float(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MF(): return map(float, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 998244353
# md = 10**9+7

n = II()
aa = LI()
ss = [sum(aa[:24])]
for i in range(n-24):
    ss.append(ss[-1]-aa[i]+aa[i+24])
mx = max(ss)
# print(mx, ss)

for _ in range(II()):
    t, v = MI()
    t -= 1
    d = v-aa[t]
    aa[t] = v
    for i in range(max(0, t-23), min(t+1, n-23)):
        ss[i] += d
        if ss[i] > mx: mx = ss[i]
    print(mx)