open Scanf
open Printf

let readint () = scanf " %d" (fun x -> x)

type rmq = { dat : int array; n : int }
module RMQ = struct
  let make (n : int) : rmq = let rec f x = if x >= n then x else f (x * 2) in { dat = Array.make (2 * f n) min_int; n = f n  }
  let update (rmq : rmq) (k : int) (v : int) =
    let k = ref (k + rmq.n) in
    rmq.dat.(!k) <- v;
    while !k > 1 do
      k := !k lsr 1;
      rmq.dat.(!k) <- max rmq.dat.(!k*2) rmq.dat.(!k*2+1)
    done
  let query (rmq : rmq) (l : int) (r : int) =
    let l = ref (l + rmq.n) in
    let r = ref (r + rmq.n - 1) in
    let ans = ref min_int in
    while !l <= !r do
      if (!l land 1) = 1 then (ans := max !ans rmq.dat.(!l); incr l);
      if (!r land 1) = 0 then (ans := max !ans rmq.dat.(!r); decr r);
      l := !l lsr 1;
      r := !r lsr 1;
    done;
    !ans
end;;

let () =
  let n = readint () in
  let a = Array.init n (fun _ -> readint ()) in
  let q = readint () in
  let rmq = RMQ.make (n - 24 + 1) in
  let calc i = Array.sub a i 24 |> Array.fold_left (+) 0 in
  for i = 0 to n - 24 do
    RMQ.update rmq i (calc i);
  done;
  for _ = 0 to q - 1 do
    let t = readint () - 1 and v = readint () in
    a.(t) <- v;
    for i = min (n - 24) t downto max 0 (t - 23) do
      RMQ.update rmq i (calc i);
    done;
    printf "%d\n" (RMQ.query rmq 0 (n - 24 + 1))
  done;