//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <type_traits>

using namespace std;

#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}

using LL = long long;

//------------------------------------------
//------------------------------------------


int main() {

    LL N;
    cin >> N;

    vector<LL> A(N);
    for (int i = 0; i < N; i++) cin >> A[i];

    LL K = 24;

    vector<LL> dp(N - K + 1, 0);
    for (int i = 0; i < K; i++) dp[0] += A[i];

    for (int i = 0; i < N - K; i++) {
        dp[i + 1] = dp[i];
        dp[i + 1] -= A[i];
        dp[i + 1] += A[i + K];
    }

    //SHOW_VECTOR(dp);

    LL maxV = *max_element(dp.begin(), dp.end());

    int Q;
    cin >> Q;

    while (Q--) {

        LL pos, val;
        cin >> pos >> val;
        pos--;

        LL plus = val - A[pos];
        A[pos] = val;

        for (LL i = max(0LL, pos - (K - 1)); i <= min(pos, N - K); i++) {
            dp[i] += plus;
            maxV = max(maxV, dp[i]);
        }

        cout << maxV << endl;
    }

}