#include <bits/stdc++.h>
using namespace std;
const long long base = 311, mod = 1e9 + 7, N = 1e5 + 11, inf = INT_MAX;
long long n, m, a[N], seg[N << 2][20], lazy[N << 2][20];
void build(long long i, long long l, long long r) {
  if (l == r) {
    for (long long j = 0; j < 20; j++) {
      if (a[l] & (1 << j))
        seg[i][j] = 1;
      else
        seg[i][j] = 0;
      lazy[i][j] = 0;
    }
    return;
  }
  long long mid = l + r >> 1;
  build(i << 1, l, mid);
  build(i << 1 | 1, mid + 1, r);
}
void down(long long i, long long l, long long r) {
  for (long long j = 0; j < 20; j++) {
    if (lazy[i][j] & 1) {
      seg[i][j] = (r - l + 1) - seg[i][j];
    }
    if (l != r && lazy[i][j] == 1) {
      lazy[i << 1][j] ^= 1;
      lazy[i << 1 | 1][j] ^= 1;
    }
    lazy[i][j] = 0;
  }
}
void update(long long i, long long l, long long r, long long u, long long v,
            long long val) {
  down(i, l, r);
  if (r < u || l > v) {
    return;
  }
  if (u <= l && r <= v) {
    for (long long j = 0; j < 20; j++) {
      if (val & (1 << j)) {
        seg[i][j] = (r - l + 1) - seg[i][j];
        if (l != r) {
          lazy[i << 1][j] ^= 1;
          lazy[i << 1 | 1][j] ^= 1;
        }
      }
    }
    return;
  }
  long long mid = l + r >> 1;
  update(i << 1, l, mid, u, v, val);
  update(i << 1 | 1, mid + 1, r, u, v, val);
  for (long long j = 0; j < 20; j++) {
    seg[i][j] = seg[i << 1][j] + seg[i << 1 | 1][j];
  }
}
long long get_sum(long long i, long long l, long long r, long long u,
                  long long v) {
  if (r < u || l > v) {
    return 0;
  }
  down(i, l, r);
  if (u <= l && r <= v) {
    long long ans = 0;
    for (long long j = 0; j < 20; j++) {
      ans += (1ll << j) * seg[i][j];
    }
    return ans;
  }
  long long mid = l + r >> 1;
  return get_sum(i << 1, l, mid, u, v) + get_sum(i << 1 | 1, mid + 1, r, u, v);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
    update(1, 1, n, i, i, a[i]);
  }
  cin >> m;
  while (m--) {
    long long op, l, r;
    cin >> op >> l >> r;
    if (op == 1) {
      cout << get_sum(1, 1, n, l, r) << endl;
    } else {
      long long x;
      cin >> x;
      update(1, 1, n, l, r, x);
    }
  }
}
