#include <bits/stdc++.h>
int gcd(int m, int n) {
  if ((0 == m) || (0 == n)) return 0;
  while (m != n)
    if (m > n)
      m = m - n;
    else
      n = n - m;
  return m;
}
int lcm(int m, int n) {
  if ((0 == m) || (0 == n)) return 0;
  return (m * n / gcd(m, n));
}
int fact(int x) {
  if (x == 1)
    return (x);
  else
    return (x * fact(x - 1));
}
int ruijou(int base, int exponent) {
  int i, answer = 1;
  i = exponent;
  while (i != 0) {
    answer = answer * base;
    --i;
  }
  return answer;
}
long long int llgcd(long long int m, long long int n) {
  if ((0 == m) || (0 == n)) return 0;
  while (m != n)
    if (m > n)
      m = m - n;
    else
      n = n - m;
  return m;
}
long long int lllcm(long long int m, long long int n) {
  if ((0 == m) || (0 == n)) return 0;
  return (m * n / llgcd(m, n));
}
long long int llfact(long long int x) {
  if (x == 1)
    return (x);
  else
    return (x * llfact(x - 1));
}
int llruijou(long long int base, long long int exponent) {
  long long int i, answer = 1;
  i = exponent;
  while (i != 0) {
    answer = answer * base;
    --i;
  }
  return answer;
}
int main() {
  int n, c1 = 0, c2 = 0, c3 = 0, c4 = 0;
  char *s;
  char s1[3] = "AC";
  char s2[3] = "WA";
  char s3[4] = "TLE";
  char s4[3] = "RE";
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%s", s);
    if (strcmp(s, s1) == 0) {
      c1++;
    }
    if (strcmp(s, s2) == 0) {
      c2++;
    }
    if (strcmp(s, s3) == 0) {
      c3++;
    }
    if (strcmp(s, s4) == 0) {
      c4++;
    }
  }
  printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);
  return 0;
}
