#include<cstdio>

#include<algorithm>

using namespace std;

struct Point{

	int x,y;

	Point(const int &x,const int &y){

		this->x=x;

		this->y=y;

	}

	Point(){}

	void read(){

		scanf("%d%d",&x,&y);

	}

}p[1005],q[1005];

typedef Point Vector;

Vector operator - (const Point &a,const Point &b){

	return Vector(a.x-b.x,a.y-b.y);

}

int Cross(const Vector &a,const Vector &b){

	return a.x*b.y-a.y*b.x;

}

bool cmp(const Point &a,const Point &b){

	return a.x!=b.x ? a.x<b.x : a.y<b.y;

}

int n,K,T;

int main(){

//	freopen("d.in","r",stdin);

	scanf("%d",&T);

	for(;T;--T){

		K=0;

		scanf("%d",&n);

		for(int i=0;i<n;++i){

			p[i].read();

		}

		sort(p,p+n,cmp);

		bool flag=1;

		for(int i=1;i<n-1;++i){

			if(Cross(p[i+1]-p[i],p[i]-p[i-1])!=0){

				flag=0;

				break;

			}

		}

		if(flag){

			puts((n-1)%2==1 ? "T^T" : "OwO");

			continue;

		}

		for(int i=0;i<n;++i){

			while(K>1 && Cross(q[K-1]-q[K-2],p[i]-q[K-1])<0){

				--K;

			}

			q[K++]=p[i];

		}

		for(int i=n-2,t=K;i>=0;--i){

			while(K>t && Cross(q[K-1]-q[K-2],p[i]-q[K-1])<0){

				--K;

			}

			q[K++]=p[i];

		}

		--K;

		int A=K-1;

		int B=n-K-1;

		int sjxs=A+B*2+1;

		puts((sjxs*3+K)/2%2==1 ? "T^T" : "OwO");

	}

	return 0;

}