#include <bits/stdc++.h>
using namespace ::std;
template <class T>
T SQR(T N) {
  return (T)N * N;
}
template <class T>
double DIST(T a, T b) {
  return 1.0 * sqrt(SQR(double(a)) + SQR(double(b)));
}
template <class T>
bool CROSS(pair<T, T> a, pair<T, T> b, pair<T, T> c) {
  return (b.first - a.first) * (c.second - b.second) >=
         (b.second - a.second) * (c.first - b.first);
}
int px[] = {0, 1, -1, 0, -1, -1, 1};
int py[] = {1, 0, 0, -1, -1, 0, -1, -1};
const double eps = 1e-9;
inline long long power(long long a, long long p, long long mod) {
  long long x = a, res = 1;
  while (p) {
    if (p & 1) res = (res * x) % mod;
    p /= 2, x = (x * x) % mod;
  }
  return res;
}
int main() {
  int n, m, c, d, a, b, k;
  int test;
  scanf("%d", &n);
  vector<string> x;
  x.push_back("AC"), x.push_back("WA"), x.push_back("TLE"), x.push_back("RE");
  map<string, int> mp;
  string str;
  for (int i = 0; i < n; ++i) cin >> str, mp[str] += 1;
  for (string it : x) cout << it << " " << mp[it] << "\n";
}
