#include <bits/stdc++.h>
using namespace std;
 
// #define int long long
 
/* short */
#define pb push_back
#define print(x) cout << x << '\n'
 
/* REPmacro */
#define REPS(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = 1; i <= (n); i++)
#define DEP(i, n) for (int i = (n); i >= 0; i--)

/* typedef */
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef pair<int, int> pii;

/* const */
const int INF = INT_MAX;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

/* func */
inline bool is_uruu(int y) {return (y % 4 == 0 && (y % 100 != 0 || y % 400 == 0));}


signed main()
{
  //ios::sync_with_stdio(false);
  int n;

  cin >> n;
  while (n--){
    int h, m;
    scanf("%d:%d", &h, &m);
    double maxD = max((h % 12 + m / 60.0) * (360 / 12.0), m * 360 / 60.0), 
           minD = min((h % 12 + m / 60.0) * (360 / 12.0), m * 360 / 60.0);
    double diff = maxD - minD;
    if (diff < 30.0){
      print("alert");
    } else if (diff < 90.0){
      print("warning");
    } else {
      print("safe");
    }
    //cout << "diff: " << diff << endl;
  }

  return (0);
}