#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
long long int gcd(long long int x, long long int y) {
  if (y == 0) return x;
  return gcd(y, x % y);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
long long int logx(long long int base, long long int num) {
  int cnt = 0;
  while (num != 1) {
    num /= base;
    ++cnt;
  }
  return cnt;
}
vector<long long int> vin(long long int n) {
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) cin >> a[i];
  return a;
}
void out(vector<long long int> a) {
  for (int i = 0; i < (long long int)a.size(); i++) {
    cout << a[i] << " ";
  }
  cout << endl;
}
void in(long long int *a, long long int n) {
  for (long long int i = 0; i < n; i++) cin >> a[i];
}
void out(long long int *a, long long int n) {
  for (long long int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << '\n';
}
void out1(vector<long long int> v) {
  for (long long int i = 0; i < (long long int)v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << endl;
}
const long long int MAXN = (long long int)(1 * 1e6 + 5), level = 22;
void solve() {
  long long int n;
  cin >> n;
  map<string, long long int> m;
  for (long long int i = 0; i < n; i++) {
    string s;
    cin >> s;
    m[s]++;
  }
  string s[4] = {"AC", "WA", "TLE", "RE"};
  for (long long int i = 0; i < 4; i++) {
    if (m.find(s[i]) == m.end()) {
      cout << s[i] << " X " << 0 << '\n';
    } else {
      cout << s[i] << " X " << m[s[i]] << '\n';
    }
  }
}
int main() {
  fast();
  long long int t = 1;
  for (long long int i = 0; i < t; i++) {
    solve();
  }
}
