#include<bits/stdc++.h>

using namespace std;

const int N = 2e5 + ;

int n, root, cnt, m = , d, last;

struct data {

    int x, y, mx_x, mn_x, mx_y, mn_y, lc, rc, sum, val;

    bool friend operator < (const data &a, const data &b) {

        if(d == ) return a.x == b.x ? a.y < b.y : a.x < b.x;

        if(d == ) return a.y == b.y ? a.x < b.x : a.y < b.y;

    }

    bool friend operator == (const data &a, const data &b) {

        return a.x == b.x && a.y == b.y;

    }

} a[N], b[N];

inline void read(int &x)

{

    x = ;

    int f = ; char c = getchar();

    while(c < '' || c > '') { if(c == '-') f = -; c = getchar(); }

    while(c >= '' && c <= '') { x = (x << ) + (x << ) + c - ''; c = getchar(); }

    x *= f;

}

bool in(int x1, int y1, int x2, int y2, int X1, int Y1, int X2, int Y2)

{

    return X1 >= x1 && Y1 >= y1 && x2 >= X2 && y2 >= Y2;

}

bool out(int x1, int y1, int x2, int y2, int X1, int Y1, int X2, int Y2)

{

    return x1 > X2 || x2 < X1 || y1 > Y2 || y2 < Y1;

}

void update(int x)

{

    a[x].mn_x = min(a[x].x, min(a[a[x].lc].mn_x, a[a[x].rc].mn_x));

    a[x].mx_x = max(a[x].x, max(a[a[x].lc].mx_x, a[a[x].rc].mx_x));

    a[x].mn_y = min(a[x].y, min(a[a[x].lc].mn_y, a[a[x].rc].mn_y));

    a[x].mx_y = max(a[x].y, max(a[a[x].lc].mx_y, a[a[x].rc].mx_y));

    a[x].sum = a[x].val + a[a[x].lc].sum + a[a[x].rc].sum;

}

int build(int l, int r, int D)

{

    if(l > r) return ;

    d = D;

    int mid = (l + r) >> ;

    nth_element(b + l, b + mid, b + r + );

    a[mid] = b[mid];

    a[mid].lc = build(l, mid - , D ^ );

    a[mid].rc = build(mid + , r, D ^ );

    update(mid);

    return mid;

}

void insert(int &x, const data &tmp, int D)

{

    d = D;

    if(!x)

    {

        x = ++cnt;

        a[x].x = a[x].mn_x = a[x].mx_x = tmp.x;

        a[x].y = a[x].mn_y = a[x].mx_y = tmp.y;

        a[x].sum = a[x].val = tmp.val;

        return;

    }

    if(a[x] == tmp)

    {

        a[x].val += tmp.val;

        a[x].sum += tmp.val;

        return;

    }

    if(tmp < a[x]) insert(a[x].lc, tmp, D ^ );

    else insert(a[x].rc, tmp, D ^ );

    update(x);

}

int query(int x, int x1, int y1, int x2, int y2)

{

    if(!x) return ;

    int ret = ;

    if(in(x1, y1, x2, y2, a[x].mn_x, a[x].mn_y, a[x].mx_x, a[x].mx_y)) return a[x].sum;

    if(out(x1, y1, x2, y2, a[x].mn_x, a[x].mn_y, a[x].mx_x, a[x].mx_y)) return ;

    if(in(x1, y1, x2, y2, a[x].x, a[x].y, a[x].x, a[x].y)) ret += a[x].val;

    ret += query(a[x].lc, x1, y1, x2, y2) + query(a[x].rc, x1, y1, x2, y2);

    return ret;

}

int main()

{

//  freopen("bzoj_4066.in", "r", stdin);

//  freopen("bzoj_4066.out", "w", stdout);

    a[].mn_x = 1e9;

    a[].mx_x = -1e9;

    a[].mn_y = 1e9;

    a[].mx_y = -1e9;

    b[].mn_x = 1e9;

    b[].mx_x = -1e9;

    b[].mn_y = 1e9;

    b[].mx_y = -1e9;

    read(n);

    while()

    {

        int opt, x1, y1, x2, y2;

        data tmp;

        read(opt);

        if(opt == )

        {

            read(tmp.x);

            read(tmp.y);

            read(tmp.val);

            tmp.x ^= last;

            tmp.y ^= last;

            tmp.val ^= last;

            insert(root, tmp, );

            if(cnt == m)

            {

                for(int i = ; i <= cnt; ++i) b[i] = a[i];

                root = build(, cnt, );

                m += ;

            }

        }

        if(opt == )

        {

            read(x1);

            read(y1);

            read(x2);

            read(y2);

            x1 ^= last;

            x2 ^= last;

            y1 ^= last;

            y2 ^= last;

            printf("%d\n", last = query(root, x1, y1, x2, y2));

        }

        if(opt == ) break;

    }

//  fclose(stdin);

//  fclose(stdout);

    return ;

}