import sys
input = sys.stdin.readline

class SegmentTree:
    def __init__(self, size, f=min, default=10 ** 18):
        self.size = 2**(size-1).bit_length() 
        self.default = default
        self.dat = [default]*(self.size*2) 
        self.f = f

    def update(self, i, x):
        i += self.size
        self.dat[i] = x
        while i > 0:
            i >>= 1
            self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])

    def query(self, l, r):
        l += self.size
        r += self.size
        lres, rres = self.default, self.default
        while l < r:
            if l & 1:
                lres = self.f(lres, self.dat[l])
                l += 1

            if r & 1:
                r -= 1
                rres = self.f(self.dat[r], rres) 
            l >>= 1
            r >>= 1
        res = self.f(lres, rres)
        return res


N = int(input())
A = list(map(int, input().split()))
Seg = SegmentTree(N, max, 0)
for i in range(N - 23):
    Seg.update(i, sum(A[i:i+24]))
    
Q = int(input())
for _ in range(Q):
    T, V = map(int, input().split())
    T -= 1
    A[T] = V
    for i in range(max(0, T - 23), min(N - 23, T + 1)):
        Seg.update(i, sum(A[i:i+24]))
    print(Seg.query(0, N))