#include <bits/stdc++.h>

using namespace std;
using ll = long long int;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  int n;
  cin >> n;
  vector<int> a(n);
  for (auto &x : a)
    cin >> x;
  vector<int> b(n);

  int sum = 0;
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (i < 24)
      sum += a[i];
    else
      sum += a[i] - a[i - 24];
    ans = max(ans, sum);
  }

  int q;
  cin >> q;
  vector<pair<int, int>> queries;
  for (int i = 0; i < q; i++) {
    int t, v;
    cin >> t >> v;
    t--;
    queries.push_back({t, v});
  }
  for (auto query : queries) {
    int t = query.first;
    int v = query.second;
    a[t] = v;
    for (int i = -23; i <= 0; i++) {
      sum = 0;
      for (int j = 0; j <= 23; j++) {
        int index = t + i + j;
        if (0 <= index && index < n)
          sum += a[index];
      }
      ans = max(ans, sum);
    }
    cout << ans << endl;
  }

  return 0;
}