#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
using namespace std;
#define eps 1e-8
struct P
{
double height;
double weight;
} p[1000];
int comage(P a,P b)
{
return a.height<b.height;//double比大小不能a-b哦
}
int main()
{
int T;
int n;
int i;
double red=0,blue=0;
cin>>T;
while(T--)
{
cin>>n;
red=0;
blue=0;
for(i=0; i<n; i++)
{
cin>>p[i].height>>p[i].weight;
}
sort(p,p+n,comage);
for(i=0; i<n; i++)
{
if(i%2==0)
red+=p[i].weight;
else
blue+=p[i].weight;
}
if(fabs(red-blue)<eps)//要知道两浮点数相等也得看精度呀
cout<<"fair"<<endl;
else if(red>blue)
cout<<"red"<<endl;
else if(red<blue)
cout<<"blue"<<endl;
}
return 0;
}
#include <stdlib.h>
#include <cmath>
#include <algorithm>
using namespace std;
#define eps 1e-8
struct P
{
double height;
double weight;
} p[1000];
int comage(P a,P b)
{
return a.height<b.height;//double比大小不能a-b哦
}
int main()
{
int T;
int n;
int i;
double red=0,blue=0;
cin>>T;
while(T--)
{
cin>>n;
red=0;
blue=0;
for(i=0; i<n; i++)
{
cin>>p[i].height>>p[i].weight;
}
sort(p,p+n,comage);
for(i=0; i<n; i++)
{
if(i%2==0)
red+=p[i].weight;
else
blue+=p[i].weight;
}
if(fabs(red-blue)<eps)//要知道两浮点数相等也得看精度呀
cout<<"fair"<<endl;
else if(red>blue)
cout<<"red"<<endl;
else if(red<blue)
cout<<"blue"<<endl;
}
return 0;
}