#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cassert>
#include<ctime>
#include<utility>
using namespace std;

#define mind(a,b) (a>b?b:a)
#define maxd(a,b) (a>b?a:b)
#define absd(x) (x<0?-(x):x)
#define pow2(x) ((x)*(x))
#define rep(i,n) for(int i=0; i<n; ++i)
#define repr(i,n) for(int i=n-1; i>=0; --i)
#define repl(i,s,n) for(int i=s; i<=n; ++i)
#define replr(i,s,n) for(int i=n; i>=s; --i)
#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)
#define repe(e,obj) for(auto e : obj)

#define SP << " " <<
#define COL << " : " <<
#define COM << ", " <<
#define ARR << " -> " <<
#define PNT(STR) cout << STR << endl
#define POS(X,Y) "(" << X << ", " << Y << ")"
#define DEB(A) " (" << #A << ") " << A
#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << " "; cout << endl
#define ALL(V) (V).begin(), (V).end()
#define INF 1000000007
#define INFLL 1000000000000000007LL
#define EPS 1e-9

typedef unsigned int uint;
typedef unsigned long ulong;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define P_TYPE int
typedef pair<P_TYPE, P_TYPE> P;
typedef pair<P, P_TYPE> PI;
typedef pair<P_TYPE, P> IP;
typedef pair<P, P> PP;
typedef priority_queue<P, vector<P>, greater<P> > pvqueue;

typedef int PType;
struct Point {
  PType x, y;
};

PType dot3(Point o, Point a, Point b) {
  return (a.x - o.x) * (b.x - o.x) + (a.y - o.y) * (b.y - o.y);
}
PType cross3(Point o, Point a, Point b) {
  return (a.x - o.x) * (b.y - o.y) - (b.x - o.x) * (a.y - o.y);
}
PType dist2(Point a, Point b) {
  return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}

bool intersect(Point p0, Point p1, Point q0, Point q1) {
  PType c0 = cross3(p0, p1, q0), c1 = cross3(p0, p1, q1);
  PType d0 = cross3(q0, q1, p0), d1 = cross3(q0, q1, p1);
  if(c0 == 0 && c1 == 0) {
    PType e0 = dot3(p0, p1, q0);
    PType e1 = dot3(p0, p1, q1);
    if( !(e0 < e1) ) {
      swap(e0, e1);
    }
    return e0 <= dist2(p0, p1) && 0 <= e1;
  }
  return c0 * c1 <= 0 && d0 * d1 <= 0;
}

bool contains(vector<Point> ps, vector<Point> qs) {
  PType p[4];
  for(int i = 0; i < 4; ++i) {
    bool pos = true, neg = true;
    for(int j = 0; j < 4; ++j) {
      PType r = cross3(ps[j], ps[(j+1)%ps.size()], qs[i]);
      if(r < 0) pos = false;
      if(r > 0) neg = false;
    }
    if(pos || neg) {
      return true;
    }
  }
  return false;
}

bool check(vector<Point> ps, vector<Point> qs) {
  if(contains(ps, qs) || contains(qs, ps)) {
    return true;
  }
  for(int i = 0; i < 4; ++i) {
    for(int j = 0; j < 4; ++j) {
      if(intersect(ps[i], ps[(i+1)%ps.size()], qs[j], qs[(j+1)%qs.size()])) {
        return true;
      }
    }
  }
  return false;
}

#define M 103
int parent[M];
int root(int x) {
  if(x == parent[x]) return x;
  return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
  int px = root(x), py = root(y);
  if(px < py) {
    parent[py] = px;
  } else {
    parent[px] = py;
  }
}

int main() {
  int n;
  while(cin >> n && n) {
    rep(i, n) {
      int m; cin >> m;
      rep(j, m) parent[j] = j;
      vector<vector<Point>> ps;
      rep(j, m) {
        vector<Point> p;
        rep(k, 4) {
          int x, y; cin >> x >> y;
          p.push_back(Point{x, y});
        }
        ps.push_back(p);
      }
      rep(i, m) {
        repl(j, i+1, m-1) {
          if(check(ps[i], ps[j])) {
            unite(i, j);
          }
        }
      }
      int res = 0;
      rep(i, m) {
        if(i == root(i)) ++res;
      }
      cout << res << endl;
    }
  }
  return 0;
}
