#include<stdio.h>
#include<math.h>
#include<string.h>
#include<vector>
#include<algorithm>
#include<limits.h>
#include<float.h>
#include<utility>
using namespace std;

int main( void )
{
	FILE *in = fopen( "roof.in", "r" );
	if( in == NULL )
		return 0;

	int TT;
	fscanf( in,"%d", &TT );
	for( int C = 0; C < TT; C ++ ){
		int n;
		fscanf( in, "%d", &n );
		vector< pair<double,double> > p;
		vector< double > ys;
		vector< pair<double, pair<double, int> > > xs;
		for( int i = 0; i < n; i ++ ){
			double x, y;
			fscanf( in, "%lf%lf", &x, &y );
			p.push_back( pair<double,double>(x,y) );
			ys.push_back( y );
		}
		for( int i = 0; i < n; i ++ ){
			int j = (i + 1) % n;
			if( p[i].first == p[j].first ){
				xs.push_back( pair<double, pair<double, int> >(
					min(ps[i].second, ps[j].second),
					pair<double, int>( p[i].first, 0 )
				);
				xs.push_back( pair<double, pair<double, int> >(
					max(ps[i].second, ps[j].second),
					pair<double, int>( p[i].first, 1 )
				);
			}
		}

		sort( ys.begin(), ys.end() );
		sort( xs.begin(), xs.end() );
		for( int i = 0; i < ys.size(); i ++ ){
			double m = ys[j] - ys[i];
			for( int j = i + 1; j < ys.size(); j ++ ){
			}
		}

	}
	fclose( in );
	return 0;
}