### Nias and Tug-of-War

Time Limit: 1000 ms Memory Limit: 65536 KiB

#### Problem Description

Nias is fond of tug-of-war. One day, he organized a tug-of-war game and invited a group of friends to take part in.

Nias will divide them into two groups. The strategy is simple, sorting them into a row according to their height from short to tall, then let them say one and two alternately (i.e. one, two, one, two...). The people who say one are the members of the red team while others are the members of the blue team.

We know that the team which has a larger sum of weight has advantages in the tug-of-war. Now give you the guys' heights and weights, please tell us which team has advantages.

#### Input

The first line of input contains an integer T, indicating the number of test cases.

The first line of each test case contains an integer N (N is even and 6 ≤ N ≤ 100).

Each of the next N lines contains two real numbers X and Y, representing the height and weight of a friend respectively.

#### Output

One line for each test case. If the red team is more likely to win, output "red", if the blue team is more likely to win, output "blue". If both teams have the same weight, output "fair".

#### Sample Input

1
6
170 55
165.3 52.5
180.2 60.3
173.3 62.3
175 57
162.2 50

#### Sample Output

blue

#### Source

“浪潮杯”山东省第六届ACM大学生程序设计竞赛