//http://acm.hdu.edu.cn/showproblem.php?pid=5126

#include<cstdio>

#include<cstdlib>

#include<iostream>

#include<fstream>

#include<algorithm>

#include<cstring>

#include<string>

#include<cmath>

#include<queue>

#include<stack>

#include<map>

#include<utility>

#include<set>

#include<bitset>

#include<vector>

#include<functional>

#include<deque>

#include<cctype>

#include<climits>

#include<complex>

//#include<bits/stdc++.h>适用于CF,UOJ，但不适用于poj

using namespace std;

typedef long long LL;

typedef double DB;

typedef pair<int,int> PII;

typedef complex<DB> CP;

#define mmst(a,v) memset(a,v,sizeof(a))

#define mmcy(a,b) memcpy(a,b,sizeof(a))

#define fill(a,l,r,v) fill(a+l,a+r+1,v)

#define re(i,a,b)  for(i=(a);i<=(b);i++)

#define red(i,a,b) for(i=(a);i>=(b);i--)

#define ire(i,x) for(typedef(x.begin()) i=x.begin();i!=x.end();i++)

#define fi first

#define se second

#define m_p(a,b) make_pair(a,b)

#define p_b(a) push_back(a)

#define SF scanf

#define PF printf

#define two(k) (1<<(k))

template<class T>inline T sqr(T x){return x*x;}

template<class T>inline void upmin(T &t,T tmp){if(t>tmp)t=tmp;}

template<class T>inline void upmax(T &t,T tmp){if(t<tmp)t=tmp;}

inline int sgn(DB x){if(abs(x)<1e-)return ;return(x>)?:-;}

const DB Pi=acos(-1.0);

int gint()

  {

        int res=;bool neg=;char z;

        for(z=getchar();z!=EOF && z!='-' && !isdigit(z);z=getchar());

        if(z==EOF)return ;

        if(z=='-'){neg=;z=getchar();}

        for(;z!=EOF && isdigit(z);res=res*+z-'',z=getchar());

        return (neg)?-res:res;

    }

LL gll()

  {

      LL res=;bool neg=;char z;

        for(z=getchar();z!=EOF && z!='-' && !isdigit(z);z=getchar());

        if(z==EOF)return ;

        if(z=='-'){neg=;z=getchar();}

        for(;z!=EOF && isdigit(z);res=res*+z-'',z=getchar());

        return (neg)?-res:res;

    }

const int maxn=;

int q,n;

struct Tstar

  {

      int p,x,y,z,s;

      Tstar(int p=,int x=,int y=,int z=,int s=):p(p),x(x),y(y),z(z),s(s){}

  };

int res[*maxn+];

bool cmpz(Tstar a,Tstar b){return a.z<b.z;}

bool cmpp(Tstar a,Tstar b){return a.p<b.p;}

int nz,tree[*maxn+];

#define lowbit(a) ((a)&(-a))

void update(int a,int v){for(;a<=nz;a+=lowbit(a))tree[a]+=v;}

int ask(int a){int res=;for(;a>=;a-=lowbit(a))res+=tree[a];return res;}

Tstar tmp[*maxn+];

Tstar star2[*maxn+];

void CDQ2(int l,int r)

  {

      if(l==r)return;

        int i,mid=(l+r)/;

        CDQ2(l,mid);

        CDQ2(mid+,r);

        int l1=l,l2=mid+;

        while()

          {

              while(l2<=r && star2[l2].s==)l2++;

              if(l2>r)break;

              while(l1<=mid && star2[l1].y<=star2[l2].y)

                {

                    if(star2[l1].s==)update(star2[l1].z,);

                    l1++;

                }

              res[star2[l2].p]+=ask(star2[l2].z);

              l2++;

          }

        re(i,l,l1-)if(star2[i].s==)update(star2[i].z,-);

        l1=l,l2=mid+;

        re(i,l,r)

          {

              if(l1>mid){tmp[i]=star2[l2++];continue;}

              if(l2>r){tmp[i]=star2[l1++];continue;}

              if(star2[l1].y<=star2[l2].y)tmp[i]=star2[l1++];else tmp[i]=star2[l2++];

          }

        re(i,l,r)star2[i]=tmp[i];

  }

Tstar star[*maxn+];

void CDQ1(int l,int r)

  {

      if(l==r)return;

      int i,mid=(l+r)/;

      CDQ1(l,mid);

      CDQ1(mid+,r);

      int l1=l,l2=mid+,n=;

      while()

        {

            while(l1<=mid && star[l1].s!=)l1++;

            while(l2<=r && star[l2].s==)l2++;

            if(l1>mid && l2>r)break;

            if(l1>mid){star2[++n]=star[l2++];continue;}

            if(l2>r){star2[++n]=star[l1++];continue;}

            if(star[l1].x<=star[l2].x)star2[++n]=star[l1++];else star2[++n]=star[l2++];

        }

        if(n>)CDQ2(,n);

        l1=l,l2=mid+;

        re(i,l,r)

          {

              if(l1>mid){tmp[i]=star[l2++];continue;}

              if(l2>r){tmp[i]=star[l1++];continue;}

              if(star[l1].x<=star[l2].x)tmp[i]=star[l1++];else tmp[i]=star[l2++];

          }

        re(i,l,r)star[i]=tmp[i];

  }

int main()

  {

      freopen("hdu5126.in","r",stdin);

      freopen("hdu5126.out","w",stdout);

      for(int Case=gint();Case;Case--)

        {

            int i,j;

            q=gint();n=;

            re(i,,q)

              {

                  int A=gint();

                  if(A==)

                    {

                        int x=gint(),y=gint(),z=gint();

                        star[++n]=Tstar(n,x,y,z,);

                    }

                  else

                    {

                        int x1=gint(),y1=gint(),z1=gint(),x2=gint(),y2=gint(),z2=gint();

                        star[++n]=Tstar(n,x2  ,y2  ,z2  , );

                        star[++n]=Tstar(n,x2  ,y2  ,z1-,-);

                        star[++n]=Tstar(n,x2  ,y1-,z2  ,-);

                        star[++n]=Tstar(n,x2  ,y1-,z1-, );

                        star[++n]=Tstar(n,x1-,y2  ,z2  ,-);

                        star[++n]=Tstar(n,x1-,y2  ,z1-, );

                        star[++n]=Tstar(n,x1-,y1-,z2  , );

                        star[++n]=Tstar(n,x1-,y1-,z1-,-);

                    }

              }

            sort(star+,star+n+,cmpz);

            nz=;

            int tmpz=-;

            re(i,,n)if(star[i].z==tmpz)star[i].z=nz;else tmpz=star[i].z,star[i].z=++nz;

            sort(star+,star+n+,cmpp);

                re(i,,n)res[i]=;

            CDQ1(,n);

            sort(star+,star+n+,cmpp);

            re(i,,n)

              if(star[i].s!=)

                {

                    int ans=;

                    re(j,,)ans+=star[i+j].s*res[i+j];

                    PF("%d\n",ans);

                    i+=;

                }

        }

      return ;

  }