#include <bits/stdc++.h> // NeOWami
using namespace std;

#define ft first
#define sc second
#define int long long
const int N = 1e5 + 5;
const int LG = 18;
int n, d[N], a[N][LG], q;

namespace sub1 {
void solve() {
    while (q--) {
        int type, u, v; cin >> type >> u >> v;
        if (type == 0) {
            int t; cin >> t;
            for (int i = u; i <= v; i++) d[i] ^= t;
        } 
        else {
            int ans = 0;
            for (int i = u; i <= v; i++) ans += d[i];
            cout << ans << "\n";
        }
    }
}
}
namespace subfull {
int st[N * 4][2][LG];
void calc(int id, int len, int i) {
    st[id][0][i] = len - st[id][0][i];
    st[id][1][i] = !st[id][1][i];
}

void down(int id, int l, int r) {
    int mid = l + r >> 1;
    for (int i = 0; i < LG; i++) if (st[id][1][i]) {
        calc(id * 2, mid - l + 1, i);
        calc(id * 2 + 1, r - mid, i);
        st[id][1][i] = 0;
    }
}
void build(int id, int l, int r) {
    if (l == r) {
        for (int i = 0; i < LG; i++) st[id][0][i] = a[l][i];
        return;
    }
    int mid = l + r >> 1;
    build(id * 2, l, mid);
    build(id * 2 + 1, mid + 1, r);
    for (int i = 0; i < LG; i++) st[id][0][i] = st[id * 2][0][i] + st[id * 2 + 1][0][i];
}

void update(int id, int l, int r, int u, int v, int p) {
    if (l > v || r < u) return;
    if (l >= u && r <= v) {
        for (int i = 0; i < LG; i++) if (p >> i & 1) calc(id, r - l + 1, i);
        return;
    }
    down(id, l, r);
    int mid = l + r >> 1;
    update(id * 2, l, mid, u, v, p);
    update(id * 2 + 1, mid + 1, r, u, v, p);
    for (int i = 0; i < LG; i++) st[id][0][i] = st[id * 2][0][i] + st[id * 2 + 1][0][i];
}

int get(int id, int l, int r, int u, int v) {
    if (l > v || r < u) return 0;
    if (l >= u && r <= v) {
        int ans = 0;
        for (int i = 0; i < LG; i++) ans += (1 << i) * st[id][0][i];
        return ans;
    }
    down(id, l, r);
    int mid = l + r >> 1;
    return get(id * 2, l, mid, u, v) + get(id * 2 + 1, mid + 1, r, u, v);
}
void solve() {
    for (int i = 1; i <= n; i++) {
        int x = d[i];
        for (int j = 0; j < LG; j++) a[i][j] = (x >> j) & 1;
    }
    build(1, 1, n);
    while (q--) {
        int type, u, v; cin >> type >> u >> v;
        if (type == 0) {
            int t; cin >> t;
            update(1, 1, n, u, v, t);
        } 
        else cout << get(1, 1, n, u, v) << "\n";
    }
}
}
signed main() {
    cin.tie(NULL)->sync_with_stdio(false);
    if(ifstream("LZXOR.inp")) {
        freopen("LZXOR.inp", "r", stdin);
        freopen("LZXOR.out", "w", stdout);  
    }
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> d[i];
    cin >> q;
    if (n * q <= 1'000'000) return sub1::solve(), 0;
    return subfull::solve(), 0;
    return 0;
}