/* -*- coding: utf-8 -*-
 *
 * 1099.cc:  No.1099 Range Square Sum - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_E2 = 1 << 19; // = 524288

/* typedef */

typedef long long ll;

template <typename T, const int MAX_E2>
struct SegTreeSQ {
  int e2;
  T s1[MAX_E2], s2[MAX_E2], dls[MAX_E2];
  SegTreeSQ() {}

  void init(int n) {
    for (e2 = 1; e2 < n; e2 <<= 1);
    //fill(nodes, nodes + MAX_E2, minf);
    //fill(dls, dls + MAX_E2, false);
  }

  T &gets1(int i) { return s1[e2 - 1 + i]; }
  T &gets2(int i) { return s2[e2 - 1 + i]; }

  void set(int i, T v) { gets1(i) = v, gets2(i) = v * v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--) {
      int j0 = j * 2 + 1, j1 = j0 + 1;
      s2[j] = s2[j0] + s2[j1];
      s1[j] = s1[j0] + s1[j1];
    }
  }

  void __update(int k, int l) {
    if (dls[k] != 0) {
      int k0 = k * 2 + 1, k1 = k0 + 1, hl = l >> 1;
      s2[k0] += dls[k] * dls[k] * hl + dls[k] * 2 * hl * s1[k0];
      s2[k1] += dls[k] * dls[k] * hl + dls[k] * 2 * hl * s1[k1];
      s1[k0] += dls[k] * hl;
      s1[k1] += dls[k] * hl;
      dls[k0] += dls[k];
      dls[k1] += dls[k];
      dls[k] = 0;
    }
  }

  void add_range(int r0, int r1, T v, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return;
    if (r0 <= i0 && i1 <= r1) {
      int l = i1 - i0;
      s2[k] += v * v * l + v * 2 * l * s1[k];
      s1[k] += v * l;
      dls[k] += v;
      return;
    }

    __update(k, i1 - i0);

    int im = (i0 + i1) / 2;
    int k0 = k * 2 + 1, k1 = k0 + 1;
    add_range(r0, r1, v, k0, i0, im);
    add_range(r0, r1, v, k1, im, i1);
    s2[k] = s2[k0] + s2[k1];
    s1[k] = s1[k0] + s1[k1];
  }
  void add_range(int r0, int r1, T v) { add_range(r0, r1, v, 0, 0, e2); }

  T s2_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return 0;
    if (r0 <= i0 && i1 <= r1) return s2[k];

    __update(k, i1 - i0);

    int im = (i0 + i1) / 2;
    T v0 = s2_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = s2_range(r0, r1, k * 2 + 2, im, i1);
    return v0 + v1;
  }
  T s2_range(int r0, int r1) { return s2_range(r0, r1, 0, 0, e2); }
};

/* global variables */

SegTreeSQ<ll,MAX_E2> st;

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);

  st.init(n);

  for (int i = 0; i < n; i++) {
    int ai;
    scanf("%d", &ai);
    st.set(i, ai);
  }
  st.setall();

  int q;
  scanf("%d", &q);
  while (q--) {
    int op;
    scanf("%d", &op);

    if (op == 1) {
      int l, r, x;
      scanf("%d%d%d", &l, &r, &x);
      l--;

      st.add_range(l, r, x);
    }
    else {
      int l, r;
      scanf("%d%d", &l, &r);
      l--;

      ll v = st.s2_range(l, r);
      printf("%lld\n", v);
    }
  }
  return 0;
}