//TLE解
#include <iostream>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
//#define endl "\n";
ll N, A[200009], Q, X, Y, L, R;
ll l, r, deg[200009];

int main(){
  cin >> N;
  for(int i = 1; i <= N; i++) cin >> A[i];
  cin >> Q;
  l = N, r = 1;
  for(int q = 1; q <= Q; q++){
    cin >> X >> Y >> L >> R;
    A[X] = Y;
    deg[L]++;
    deg[R + 1]--;
    l = min(l, L);
    r = max(r, R);
    ll cnt = 0;
    for(int i = 1; i < l; i++) cnt += deg[i];
    ll ans = 0;
    for(int i = l; i <= r; i++){
      cnt += deg[i];
      ans += A[i] * cnt;
    }
    cout << ans << endl;
  }
  return 0;
}