#include <bits/stdc++.h>
using namespace std;const int maxn = 300 + 5;
const int inf = 0x3f3f3f3f;
struct point{double f;double x, y, r;
} p[maxn];
struct edge{int to, w, next;
} ed[maxn*maxn<<2];
int k, n, sp, tp;
int head[maxn<<1], tot, d[maxn<<1], maxflow;
inline void init(){memset( head, -1, sizeof(head) );tot = 1;
}inline double getlen2( const point a, const point b ){double x1 = a.x, x2 = b.x;double y1 = a.y, y2 = b.y;return (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
}inline bool judge(point a, point b){return getlen2(a, b) < (a.r+b.r)*(a.r+b.r);
}inline void add( int u, int v, int w ){ed[++tot].to = v; ed[tot].w = w; ed[tot].next = head[u]; head[u] = tot;ed[++tot].to = u; ed[tot].w = 0; ed[tot].next = head[v]; head[v] = tot;
}inline bool bfs(){memset( d, 0, sizeof(d) );queue<int> q;d[sp] = 1;q.push(sp);while( !q.empty() ){int x = q.front();q.pop();for( int i=head[x]; i!=-1; i=ed[i].next ){int y = ed[i].to;if( ed[i].w && !d[y] ){d[y] = d[x] + 1;q.push(y);if( y==tp ) return 1;}}}return 0;
}inline int dfs( int x, int flow ){if( x==tp ) return flow;int res = flow, k;for( int i=head[x]; i!=-1&&res; i=ed[i].next ){int y = ed[i].to;if( ed[i].w && d[y]==d[x]+1 ){k = dfs( y, min( res, ed[i].w ) );if(!k) d[y] = 0;ed[i].w -= k;ed[i^1].w += k;res -= k;}}return flow - res;
}inline void dinic(){int flow = maxflow = 0;while( bfs() ){while( flow = dfs(sp, inf) ) maxflow += flow;}
}int main(){// freopen("in.txt", "r", stdin);scanf("%d", &k);while( k-- ){scanf("%d", &n);init();for( int i=1; i<=n; i++ ){scanf("%lf%lf%lf%lf", &p[i].f, &p[i].x, &p[i].y, &p[i].r);if( p[i].f==400.0 ) tp = i;else if( p[i].f==789.0 ) sp = i;else add( i, i+n, 1 );}if( judge( p[sp], p[tp] ) ){puts("Game is VALID");continue;}add( sp, sp+n, 2 );for( int i=1; i<=n; i++ )for( int j=i+1; j<=n; j++ ){if( judge(p[i], p[j]) ){if( p[i].f<p[j].f ) add( j+n, i, 1 );else add( i+n, j, 1 );}}dinic();// cout << maxflow << endl;if( maxflow>=2 ) puts("Game is VALID");else puts("Game is NOT VALID");}return 0;
}
/*
Game is NOT VALID
Game is VALID*/