#include <bits/stdc++.h>
using namespace std;
bool isprime(long long int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
vector<long long int> prime;
void sieve(long long int n) {
  bool bakh[n + 1];
  memset(bakh, true, sizeof(bakh));
  for (long long int p = 2; p * p <= n; p++) {
    if (bakh[p] == true) {
      for (long long int i = p * p; i <= n; i += p) bakh[i] = false;
    }
  }
  for (long long int p = 2; p <= n; p++)
    if (bakh[p]) prime.push_back(p);
}
long long int eulertotient(long long int z) {
  long long int fac = z;
  for (long long int i = 0; prime[i] * prime[i] <= z; i++) {
    if (z % prime[i] == 0) {
      fac -= (fac / prime[i]);
      while (z % prime[i] == 0) z /= prime[i];
    }
  }
  if (z > 1) fac -= (fac / z);
  return fac;
}
long long int power(long long int x, long long int y, long long int p) {
  long long int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long int lcm(long long int a, long long int b) {
  long long int g = gcd(a, b);
  long long int ans = (a * b) / g;
  return ans;
}
long long int modInverse(long long int a, long long int m) {
  long long int hvf = gcd(a, m);
  if (hvf == 1) return power(a, m - 2, m);
  return -1;
}
void multiply(long long int F[2][2], long long int M[2][2]) {
  long long int x = F[0][0] * M[0][0] + F[0][1] * M[1][0];
  long long int y = F[0][0] * M[0][1] + F[0][1] * M[1][1];
  long long int z = F[1][0] * M[0][0] + F[1][1] * M[1][0];
  long long int w = F[1][0] * M[0][1] + F[1][1] * M[1][1];
  F[0][0] = x;
  F[0][1] = y;
  F[1][0] = z;
  F[1][1] = w;
}
void powermat(long long int F[2][2], long long int n) {
  if (n == 0 || n == 1) return;
  long long int M[2][2] = {{1, 1}, {1, 0}};
  powermat(F, n / 2);
  multiply(F, F);
  if (n % 2 != 0) multiply(F, M);
}
long long int fib(long long int n) {
  long long int F[2][2] = {{1, 1}, {1, 0}};
  if (n == 0) return 0;
  powermat(F, n - 1);
  return F[0][0];
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long int t, n, a, b, w, x, y, z;
  cin >> t;
  map<long long int, long long int> dx, dy;
  map<long long int, long long int>::iterator it;
  while (t--) {
    cin >> n;
    dx.clear();
    dy.clear();
    long long int c;
    for (long long int i = 0; i < n; i++) {
      cin >> a >> b;
      cin >> w >> x >> y >> z;
      if (w == 1) dx[0] += 1, dx[100000 + a + 1] -= 1;
      if (x == 1) dy[b + 100000] += 1, dy[200000 + 1] -= 1;
      if (y == 1) dx[a + 100000] += 1, dx[200000 + 1] -= 1;
      if (z == 1) dy[0] += 1, dy[100000 + b + 1] -= 1;
      if (w == 1 && y == 1) dx[a + 100000] -= 1, dx[a + 100001] += 1;
      if (x == 1 && z == 1) dy[b + 100000] -= 1, dy[b + 100001] += 1;
      if (w == 0 && y == 0) dx[a + 100000] += 1, dx[a + 100001] -= 1;
      if (x == 0 && z == 0) dy[b + 100000] += 1, dy[b + 100001] -= 1;
    }
    long long int flag = 0, p = 1e5;
    x = INT_MIN, y = INT_MIN;
    it = dx.begin();
    c = 0;
    while (it != dx.end()) {
      c += it->second;
      if (c == n) {
        x = it->first - p;
        break;
      }
      ++it;
    }
    it = dy.begin();
    c = 0;
    while (it != dy.end()) {
      c += it->second;
      if (c == n) {
        y = it->first - p;
        break;
      }
      ++it;
    }
    if (x == INT_MIN || y == INT_MIN)
      cout << 0 << endl;
    else
      cout << "1 " << x << " " << y << endl;
  }
}
