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

signed main(){
  int n; cin >> n; vector<int> segtree0(2*n),segtree1(2*n); for (int i(0);i < n;++i) cin >> segtree1[n+i];
  for (int i(n-1);i;--i) segtree1[i] = segtree1[i<<1]+segtree1[i<<1|1];
  int q,res(0); cin >> q;
  while(q--){
    int x,y,l,r; cin >> x >> y >> l >> r; y -= segtree1[x+n-1];
    for (int i(x+n-1);i;i>>=1) res += segtree0[i]*y,segtree1[i] += y;
    for (l += n-1,r += n;l < r;l>>=1,r>>=1){
      if (l&1) ++segtree0[l],res += segtree1[l++];
      if (r&1) ++segtree0[--r],res += segtree1[r];
    }
    cout << res << endl;
  }
}