#include<bits/stdc++.h>
using namespace std;
const double eps = 1e-4;//精度的选择要合适
int main(){
int t;
scanf("%d",&t);
while(t--){
double x[25],y[25];
for(int i = 0;i < 20;i++)
scanf("%lf%lf",&x[i],&y[i]);
double res = 0;
for(int i = 0;i < 20;i++){
res=res+(x[i]*y[(i+1)%20]-x[(i+1)%20]*y[i]);
}
res = res / 2;
if(res > 0){
int flag = 0;
for(int i = 0;i < 20;i++){
if(fabs((x[i]-x[(i+1)%20])*(x[i]-x[(i+1)%20])+(y[i]-y[(i+1)%20])*(y[i]-y[(i+1)%20])-81.0)<eps){
if(fabs((x[(i+1)%20]-x[(i+2)%20])*(x[(i+1)%20]-x[(i+2)%20])+(y[(i+1)%20]-y[(i+2)%20])*(y[(i+1)%20]-y[(i+2)%20])-64.0)<eps){
flag = 1;
}
}
}
if(flag) printf("right\n");
else printf("left\n");
}
else{
int ok = 0;
for(int i = 0;i < 20;i++){
if(fabs((x[i]-x[(i+1)%20])*(x[i]-x[(i+1)%20])+(y[i]-y[(i+1)%20])*(y[i]-y[(i+1)%20])-64.0)<eps){
if(fabs((x[(i+1)%20]-x[(i+2)%20])*(x[(i+1)%20]-x[(i+2)%20])+(y[(i+1)%20]-y[(i+2)%20])*(y[(i+1)%20]-y[(i+2)%20])-81.0)<eps){
ok = 1;
}
}
}
if(ok) printf("right\n");
else printf("left\n");
}
}
return 0;
}
/*题解:
一、先判断是顺时针旋转还是逆时针旋转
判断方法:
1.如果(凹多边形/凸多边形的面积 / 2 > 0)逆时针旋转
< 0 顺时针旋转
2.多边形的面积:(x1y2-x2y1)+(x2y3-x3y2)+...+(xny1-x1yn)
二、判断8在9的哪一边即可
*/
09-16