#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
  int n; cin >> n;
  vector<int> A(n),segtree0(2*n),segtree1(2*n); for (int& a:A) cin >> a;
  copy(A.begin(),A.end(),segtree1.begin()+n); __int128_t res = 0,mx = 1;
  for (int i(0);i < 17;++i) mx *= 10;
  for (int i(n-1);i;--i) segtree1[i] = segtree1[i<<1]+segtree1[i<<1|1];
  int q; cin >> q;
  while(q--){
    int a,b,c,d; cin >> a >> b >> c >> d; --a,--c;
    for (int l(n+a);l;l>>=1) res += (b-A[a])*segtree0[l],segtree1[l] += b-A[a];
    for (int l(n+c),r(n+d);l < r;l>>=1,r>>=1){
      if (l&1) res += segtree1[l],++segtree0[l++];
      if (r&1) res += segtree1[--r],++segtree0[r];
    }
    A[a] = b;
    cout << (long long)res << endl;
    assert(res<=mx);
  }
}