#include<bits/stdc++.h>
using namespace std;
typedef  long long  ll;
ll mod = pow(10, 9) + 7;
typedef unsigned long long  ull;
int gcdExtended(int a, int b, int *x, int *y);

// Function to find modulo inverse of b. It returns
// -1 when inverse doesn't
int modInverse(int b, int m)
{
  int x, y; // used in extended GCD algorithm
  int g = gcdExtended(b, m, &x, &y);

  // Return -1 if b and m are not co-prime
  if (g != 1)
    return -1;

  // m is added to handle negative x
  return (x % m + m) % m;
}
int gcdExtended(int a, int b, int *x, int *y)
{
  // Base Case
  if (a == 0)
  {
    *x = 0, *y = 1;
    return b;
  }

  int x1, y1; // To store results of recursive call
  int gcd = gcdExtended(b % a, a, &x1, &y1);

  // Update x and y using results of recursive
  // call
  *x = y1 - (b / a) * x1;
  *y = x1;

  return gcd;
}
string decimalToBinary(int n)
{
  //finding the binary form of the number and
  //coneverting it to string.
  string s = bitset<64> (n).to_string();

  //Finding the first occurance of "1"
  //to strip off the leading zeroes.
  const auto loc1 = s.find('1');

  if (loc1 != string::npos)
    return s.substr(loc1);

  return "0";
}
int binaryToDecimal(int n)
{
  int num = n;
  int dec_value = 0;

  // Initializing base value to 1, i.e 2^0
  int base = 1;

  int temp = num;
  while (temp) {
    int last_digit = temp % 10;
    temp = temp / 10;

    dec_value += last_digit * base;

    base = base * 2;
  }

  return dec_value;
}
int factorial(int n);
int factorial(int n)
{ int ans = 1;
  while (n != 1)
  {
    ans = ((ans % mod) * (n % mod)) % mod;

    n--;

  }
  return ans;

}
ull sumbincoef( int N, int k ) {
  ull   bincoef = 1, sum = 1;
  int i;
  for ( i = 1 ; i < k ; ++i ) {
    bincoef = (bincoef * (N - i + 1) / i);
    sum += bincoef;
  }
  return sum;
}

bool is_prime(ll n) {
  // Assumes that n is a positive natural number
  // We know 1 is not a prime number
  if (n == 1) {
    return false;
  }

  ll i = 2;
  // This will loop from 2 to int(sqrt(x))
  while (i * i <= n) {
    // Check if i divides x without leaving a remainder
    if (n % i == 0) {
      // This means that n has a factor in between 2 and sqrt(n)
      // So it is not a prime number
      return false;
    }
    i += 1;
  }
  // If we did not find any factor in the above loop,
  // then n is a prime number
  return true;
}
int gcd(int a, int b)
{
  if (a == 0)
    return b;
  return gcd(b % a, a);
}
typedef unsigned long long  ull;

typedef unsigned int ui;










int main()
{ ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif

  int t ;
  cin >> t;
  while (t > 0)
  {
    int n;
    cin >> n;
    string a;
    cin >> a;

    string b;
    cin >> b;
    int r = 0;
    int bl = 0;
    for (int i = 0; i < n; i++)
    {
      if (a[i] > b[i])
      {
        r++;
      }
      else if (a[i] < b[i])
      {
        bl++;
      }

    }
    if (r > bl)
    {
      cout << "RED" << endl;
    }
    else if (r < bl)
    {
      cout << "BLUE" << endl;

    }
    else
    {
      cout << "EQUAL" << endl;
    }


    t--;

  }







}