#include <bits/stdc++.h>
using namespace std;
long long spf[101];
long long fac[101];
void sieve() {
  spf[1] = 1;
  for (long long i = 2; i < 101; i++) spf[i] = i;
  for (long long i = 4; i < 101; i += 2) spf[i] = 2;
  for (long long i = 3; i * i < 101; i++) {
    if (spf[i] == i) {
      for (long long j = i * i; j < 101; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
map<long long, long long> getfactor(long long a) {
  map<long long, long long> m;
  while (a > 1) {
    m[spf[a]]++;
    a /= spf[a];
  }
  return m;
}
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0 || y < 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inverse(long long a, long long p) { return power(a, p - 2, p); }
long long ncr(long long n, long long r, long long p) {
  if (r > n) return 0;
  if (r == 0 || r == n) return 1;
  return (fac[n] * inverse(fac[r], p) % p * inverse(fac[n - r], p) % p) % p;
}
long long bit[7][14][100001];
void update(long long ind, long long val, long long type, long long sub) {
  while (ind <= 100000) {
    bit[type][sub][ind] += val;
    ind += ind & (-ind);
  }
}
long long get(long long ind, long long type, long long sub) {
  long long tot = 0;
  while (ind > 0) {
    tot += bit[type][sub][ind];
    ind -= ind & (-ind);
  }
  return tot;
}
void solve() {
  long long n;
  cin >> n;
  long long a[n + 1];
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    for (long long j = 2; j <= 6; j++) {
      long long temp = i % (2 * j - 2);
      update(i, a[i], j, temp);
    }
  }
  long long m;
  cin >> m;
  while (m--) {
    long long t;
    cin >> t;
    if (t == 1) {
      long long i, val;
      cin >> i >> val;
      for (long long j = 2; j <= 6; j++) {
        long long temp = i % (2 * j - 2);
        update(i, -a[i], j, temp);
        update(i, val, j, temp);
      }
      a[i] = val;
    } else {
      long long l, r, z;
      cin >> l >> r >> z;
      long long ans = 0, cur = l % (2 * z - 2);
      for (long long j = 1; j <= z + z - 2; j++) {
        ans += (j <= z ? j : z + z - j) * (get(r, z, cur) - get(l - 1, z, cur));
        cur = (cur + 1) % ((2 * z - 2));
      }
      cout << ans << '\n';
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long test = 1;
  while (test--) {
    solve();
  }
}
