#include
     
       #include
      
        using namespace std; struct Point3 {
      double x, y, z;   Point3(double x=0, double y=0, double z=0):x(x),y(y),z(z) { }   void read()   {
         scanf("%lf%lf%lf", &x, &y, &z);   } }; typedef Point3 Vector3; Vector3 operator + (const Vector3& A, const Vector3& B) { return Vector3(A.x+B.x, A.y+B.y, A.z+B.z); } Vector3 operator - (const Point3& A, const Point3& B) { return Vector3(A.x-B.x, A.y-B.y, A.z-B.z); } Vector3 operator * (const Vector3& A, double p) { return Vector3(A.x*p, A.y*p, A.z*p); } Vector3 operator / (const Vector3& A, double p) { return Vector3(A.x/p, A.y/p, A.z/p); } const double eps = 1e-8; int dcmp(double x) {
      if(fabs(x) < eps) return 0; else return x < 0 ? -1 : 1; } double Dot(const Vector3& A, const Vector3& B) { return A.x*B.x + A.y*B.y + A.z*B.z; } double Length(const Vector3& A) { return sqrt(Dot(A, A)); } double Angle(const Vector3& A, const Vector3& B) { return acos(Dot(A, B) / Length(A) / Length(B)); } Vector3 Cross(const Vector3& A, const Vector3& B) { return Vector3(A.y*B.z - A.z*B.y, A.z*B.x - A.x*B.z, A.x*B.y - A.y*B.x); } double Area2(const Point3& A, const Point3& B, const Point3& C) { return Length(Cross(B-A, C-A)); } // p1和p2是否在线段a-b的同侧 bool SameSide(const Point3& p1, const Point3& p2, const Point3& a, const Point3& b) {
      return dcmp(Dot(Cross(b-a, p1-a), Cross(b-a, p2-a))) >= 0; } // 点在三角形P0, P1, P2中 bool PointInTri(const Point3& P, const Point3& P0, const Point3& P1, const Point3& P2) {
      return SameSide(P, P0, P1, P2) && SameSide(P, P1, P0, P2) && SameSide(P, P2, P0, P1); } // 三角形P0P1P2是否和线段AB相交 bool TriSegIntersection(const Point3& P0, const Point3& P1, const Point3& P2, const Point3& A, const Point3& B, Point3& P) {
      Vector3 n = Cross(P1-P0, P2-P0);   if(dcmp(Dot(n, B-A)) == 0) return false; // 线段A-B和平面P0P1P2平行或共面   else { // 平面A和直线P1-P2有惟一交点     double t = Dot(n, P0-A) / Dot(n, B-A);     if(dcmp(t) < 0 || dcmp(t-1) > 0) return false; // 不在线段AB上     P = A + (B-A)*t; // 交点     return PointInTri(P, P0, P1, P2);   } } bool TriTriIntersection(Point3* T1, Point3* T2) {
      Point3 P;   for(int i = 0; i < 3; i++) {
        if(TriSegIntersection(T1[0], T1[1], T1[2], T2[i], T2[(i+1)%3], P)) return true;     if(TriSegIntersection(T2[0], T2[1], T2[2], T1[i], T1[(i+1)%3], P)) return true;   }   return false; } Point3  p[4],q[4]; int main() {
        int cas;     scanf("%d",&cas);     while(cas--)     {
            int flag=0;         for(int i=0;i<3;i++) p[i].read();         for(int i=0;i<3;i++) q[i].read();         printf("%d\n",TriTriIntersection(p,q)?1:0);     }     return 0; }