stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

    for (int i = 0; i < N; i++) {

        cin >> S[i];

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "AC") {

            A ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "WA") {

            W ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "TLE") {

            T ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "RE") {

            R ++;

        }

    }

    cout << "AC x " << A<<endl;

    cout << "WA x " << W<<endl;

    cout << "TLE x " << T<<endl;

    cout << "RE x " << R <<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.365210432173955x):
#include<iostream>

#include<string>

using namespace std;

int main(){

	int t, c0 = 0, c1 = 0, c2 = 0, c3  = 0;

	cin>>t;

	string test;

	while(t--){

		cin>>test;

		if(test == "AC")

		   c0++;

		else if(test == "WA")

		   c1++;

		else if(test == "TLE")

		   c2++;

		else if(test == "RE")

		   c3++;

	}

	cout<<"AC"<<" x "<<c0<<endl;

	cout<<"WA"<<" x "<<c1<<endl;

	cout<<"TLE"<<" x "<<c2<<endl;

	cout<<"RE"<<" x "<<c3<<endl;

	

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

    for (int i = 0; i < N; i++) {

        cin >> S[i];

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "AC") {

            A ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "WA") {

            W ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "TLE") {

            T ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "RE") {

            R ++;

        }

    }

    cout << "AC x " << A<<endl;

    cout << "WA x " << W<<endl;

    cout << "TLE x " << T<<endl;

    cout << "RE x " << R <<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.369213069196857x):
#include <iostream>

#include <string>



using namespace std;



int main()

{

    int N;

    cin>>N;



    int AC=0,WA=0,TLE=0,RE=0;

    string s;



    while(N--)

    {

        cin>>s;



        if(s.compare("AC")==0)

            AC++;



        if(s.compare("WA")==0)

            WA++;



        if(s.compare("TLE")==0)

            TLE++;



        if(s.compare( "RE")==0)

            RE++;





    }



    cout<<"AC x "<<AC<<"\n";

    cout<<"WA x "<<WA<<"\n";

    cout<<"TLE x "<<TLE<<"\n";

    cout<<"RE x "<<RE<<"\n";

}
// Slower C++ solution:
#include <iostream>

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

    for (int i = 0; i < N; i++) {

        cin >> S[i];

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "AC") {

            A ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "WA") {

            W ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "TLE") {

            T ++;

        }

    }

    for (int i = 0; i < N; i++) {

        if (S[i] == "RE") {

            R ++;

        }

    }

    cout << "AC x " << A<<endl;

    cout << "WA x " << W<<endl;

    cout << "TLE x " << T<<endl;

    cout << "RE x " << R <<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.3047903040154125x):
#include<iostream>

#include<cstdio>

#include<map>

using namespace std;

int main(void)

{

    ios::sync_with_stdio(false);

    map<string,int> mp;

    int n;

    char ch[10];

    while(cin>>n)

    {

        for(int i=0;i<n;++i)

        cin>>ch,mp[ch]++;

        printf("AC x %d\n",mp["AC"]);

        printf("WA x %d\n",mp["WA"]);

        printf("TLE x %d\n",mp["TLE"]);    

        printf("RE x %d\n",mp["RE"]);

    }

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<string>

#include<stdio.h>

#include<stdlib.h>

#include<set>

#include<map>

#include<vector>

#include<queue>

using namespace std;

#define mp(a,b) make_pair(a,b)

#define pb push_back



int main(){

    int n;

    cin>>n;

    int a[5];

    for (int i=1;i<=4;i++){

        a[i] = 0;

    }

    string sss;

    for (int i=1;i<=n;i++){

        cin>>sss;

        if (sss == "AC"){

            a[1]++;

        }

        if (sss == "WA"){

            a[2]++;

        }

        if (sss == "TLE"){

            a[3]++;

        }

        if (sss == "RE"){

            a[4]++;

        }

    }

    cout<<"AC x "<<a[1]<<endl;

    cout<<"WA x "<<a[2]<<endl;

    cout<<"TLE x "<<a[3]<<endl;

    cout<<"RE x "<<a[4]<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.249946408189987x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
// In the name of God



#include <bits/stdc++.h>



using namespace std;



int main() {

	ios_base::sync_with_stdio(false);

	cin.tie(0);



	map<string, int> mp;



	int n;

	cin >> n;

	while(n--) {

		string s;

		cin >> s;

		mp[s]++;

	}



	cout << "AC x " << mp["AC"] << "\n";

	cout << "WA x " << mp["WA"] << "\n";

	cout << "TLE x " << mp["TLE"] << "\n";

	cout << "RE x " << mp["RE"] << "\n";



	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.338965784284757x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

using namespace std;



typedef long long ll;

const int N = 2e5 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;



#define PI acos(-1)

#define clr(arr, val) memset(arr, val, sizeof(arr))

#define loop(i, n) for (int i = 0; i < int(n); i++)

#define rloop(i, n) for (int i = int(n) - 1; i >= 0; i--)

#define xloop(i, a, b) for (int i = int(a); i <= int(b); i++)

#define ALL(v) ((v).begin()), ((v).end())

#define SZ(v) ((int)((v).size()))

//int dx[] = {1, 0, -1, 0};

//int dy[] = {0, 1, 0, -1}; //4 Direction

int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};

int dy[] = {0, 1, 1, 1, 0, -1, -1, -1}; //8 direction

//int dx[]={2,1,-1,-2,-2,-1,1,2};int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight Direction

//int dx[6]={2,1,-1,-2,-1,1};int dy[6]={0,1,1,0,-1,-1}; //Hexagonal Direction



int n;

int main()

{

  //ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);



  cin >> n;

  string s;

  map < string , int > cnt;

  for(int i = 0 ; i < n ; ++i){

    cin >> s;

    cnt[s]++;

  }



  cout << "AC x " << cnt["AC"] << "\n";

  cout << "WA x " << cnt["WA"] << "\n";

  cout << "TLE x " << cnt["TLE"] << "\n";

  cout << "RE x " << cnt["RE"] << "\n";





  return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.267022400410967x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>

#include <unordered_map>

#define endl '\n';

#define all(v) ((v).begin()), ((v).end())

#define sz(s)               (int)s.size()

#define Ceil(x,y)             ((x+y-1)/y)

#define RT(x)           return cout<<x,0;

#define mem(x,y)    memset(x,y,sizeof(x))

#define vi                    vector<int>

#define pii                 pair<int,int>

#define fx(n)           fixed<<setprecision(n)

#define watch(x) cout<<(#x)<<" = "<<x<<endl

#define forr(i, n) for (int i = 0; i < int(n); i++)

typedef long long ll;

typedef unsigned long long ull;

typedef double dl;

const double PI = acos(-1), EPS = 1e-7;

const int OO = 0x3f3f3f3f, N = 1e7 + 5, MOD = 1e9 + 7;

using namespace std;

void fast() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); }

int main()

{

	fast();

	int n;

	cin>>n;

	map<string,int>mp;

	string s;

	while(n--)

    {

        cin>>s;

        mp[s]++;

    }

    cout<<"AC x "<<mp["AC"]<<"\n";

    cout<<"WA x "<<mp["WA"]<<"\n";

    cout<<"TLE x "<<mp["TLE"]<<"\n";

    cout<<"RE x "<<mp["RE"]<<"\n";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.376588200531862x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main() {

    int n,AC=0,WA=0,TLE=0,RE=0;

    cin >> n;

    string s;

    for (int i = 0; i < n ; i++) {

        cin>>s;

        if (s=="AC")

            AC++;

        else if (s=="WA")

            WA++;

        else if (s=="TLE")

            TLE++;

        else

            RE++;

    }

    cout<<"AC x "<<AC<<endl;

    cout<<"WA x "<<WA<<endl;

    cout<<"TLE x "<<TLE<<endl;

    cout<<"RE x "<<RE<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.249193708804314x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;



int main()

{

    int n,nAC=0,nWA=0,nTLE=0,nRE=0,i;

    string in;

    cin>>n;

    for(i=0; i<n; i++)

    {

        cin>>in;

        if(in=="AC")

            nAC++;

        else if(in=="WA")

            nWA++;

        else if(in=="TLE")

            nTLE++;

        else

            nRE++;

    }

    cout<<"AC x "<<nAC<<endl;

    cout<<"WA x "<<nWA<<endl;

    cout<<"TLE x "<<nTLE<<endl;

    cout<<"RE x "<<nRE<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.249225091395762x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#include<cstdlib>



/*If you are going to try,keep going until the end ,or don't even try to start*/



/* Remember, Hope is a good thing... May be the best of things... And No Good thing ever Dies !!!*/



using namespace std;



#define ll long long

#define nada "\n"

#define st string

#define S  second

#define F  first

#define pb push_back

#define MP make_pair

#define isnttriangle(a,b,c)  (a+b<c||a+c<b||b+c<a)

#define todegree(rad) rad*(180.0/pi)

#define rrp(i, a, b)  for(ll i = a; i >= b; i--)

#define repp(i,a,b)   for (int i = int(a); i <=int(b); i++)

#define rep(i, n)     for (int i = 0; i <n; i++)

#define rep1(i,n)     for (int i = 1; i <=n; i++)

#define allr(v)       ((v).rbegin()), ((v).rend())

#define all(v)        ((v).begin()),((v).end())

#define fx(n)         cout<<fixed<<setprecision(n);

#define sz(v)         ((int)(v).size())

#define Test          ll t;cin>>t;while(t--)

#define mod           1000000009LL





const double ME = 2.71828;

const int    N  = 3e5 + 20;

const int   inf = 0x3f3f3f3f;

const double pi = 3.141592653;









void LOSER()

{

    ios::sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

}



void file()

{

    freopen("records.in", "r", stdin);

    //freopen("text.out", "w", stdout);

}



ll gcd(ll a, ll b)

{

    //Eculidean Algorthim

    return (!b) ? a : gcd(b, a % b);

    //complixty=log(ab);

}



ll lcm(ll a,ll b)

{

    return a / gcd(a, b) * b;

}



ll Fib_recur(ll n)

{

    vector<ll>v(n+5,0);

    //BaseCase

    v[1]=0;

    v[2]=1;

    repp(i,3,n)v[i]=v[i-1]+v[i-2];

    return v[n];

}



bool isprime(int n)

{

    for(int i = 2; i <= sqrt(n); i++)

    {

        if(n%i == 0)

            return false;

    }

    return true;

}



void Solve()

{



  int n,AC=0,WA=0,TLE=0,RE=0;

  st s;

  cin>>n;

  while(n--)

  {

      cin>>s;

      if(s=="AC")AC++;

      if(s=="WA")WA++;

       if(s=="TLE")TLE++;

        if(s=="RE")RE++;

  }

  cout<<"AC"<<" x "<<AC<<nada;

  cout<<"WA"<<" x "<<WA<<nada;

  cout<<"TLE"<<" x "<<TLE<<nada;

  cout<<"RE"<<" x "<<RE<<nada;

}











int main()

{

    // fx(7)

    //file();

    LOSER();

    //Test



    Solve();















}

// Faster C++ solution for the same problem (measured speedup: 5.313987655536951x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

using namespace std;

int main()

{

	int N, counter_ac = 0, counter_wa = 0, counter_tle = 0, counter_re = 0;

	cin >> N;

	string s;

	for (int i = 0; i < N; i++)

	{

		cin >> s;

		if (s == "AC")

		{

			counter_ac++;

		}

		else if (s == "WA")

		{

			counter_wa++;

		}

		else if (s == "TLE")

		{

			counter_tle++;

		}

		else if (s == "RE")

		{

			counter_re++;

		}

	}

	cout << "AC x " << counter_ac << endl;

	cout << "WA x " << counter_wa << endl;

	cout << "TLE x " << counter_tle << endl;

	cout << "RE x " << counter_re << endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.248917541999564x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <string>

#include <algorithm>

#include <cmath>

using namespace std;

int main()

{  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

   // your code goes here

    int t;long long c0=0,c1=0,c2=0,c3=0;

    string s;

    cin>>t;

    for (int i=1;i<=t;i++)

    {

        cin>>s;

        if (s=="AC")c0++;

        else if (s=="WA")c1++;

        else if (s=="TLE")c2++;

        else if (s=="RE")c3++;

    }

    cout<<"AC x "<<c0<<endl;

    cout<<"WA x "<<c1<<endl;

    cout<<"TLE x "<<c2<<endl;

    cout<<"RE x "<<c3<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 5.313396214390415x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    int n,ac(0),wa(0),tle(0),re(0); cin>>n;

    string x[n];

    for (int i=0;i<n;i++) {

        cin>>x[i];

        if (x[i]=="AC") ac++;

        else if (x[i]=="WA") wa++;

        else if (x[i]=="TLE") tle++;

        else re++;

    }

    printf ("AC x %d \nWA x %d \nTLE x %d \nRE x %d \n", ac, wa, tle, re);

}


// Faster C++ solution for the same problem (measured speedup: 5.187014656153016x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;



int n,c[4];

char s[1010];



int main()

{

	scanf("%d",&n);

	for(int i=1;i<=n;i++)

	{

		scanf("%s",s);

		if(s[0]=='A'&&s[1]=='C'&&strlen(s)==2) c[0]++;

		if(s[0]=='W'&&s[1]=='A'&&strlen(s)==2) c[1]++;

		if(s[0]=='T'&&s[1]=='L'&&s[2]=='E'&&strlen(s)==3) c[2]++;

		if(s[0]=='R'&&s[1]=='E'&&strlen(s)==2) c[3]++;

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n",c[0],c[1],c[2],c[3]);

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.132378530058729x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

	int n;char str[20];

	scanf("%d", &n);

	int a = 0, b = 0, c = 0, d = 0;

	while(n--)

	{

		scanf("%s", str);

		switch(str[0]){

			case'A':a++; break;

			case'W':b++;break;

			case'T':c++;break;

			case'R':d++;break;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", a, b, c, d);

	return 0;

} 

// Faster C++ solution for the same problem (measured speedup: 5.1288173301429305x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int ac,wa,re,tle;

int main(){

	int n;

	char s[8];

	scanf("%d",&n);

	while(n--){

		scanf("%s",s);

		if(s[0]=='A') ac++;

		if(s[0]=='W') wa++;

		if(s[0]=='T') tle++;

		if(s[0]=='R') re++;

	}

	cout<<"AC x "<<ac<<endl;

	cout<<"WA x "<<wa<<endl;

	cout<<"TLE x "<<tle<<endl;

	cout<<"RE x "<<re<<endl;

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.193791847478674x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int n,ans[5];

string s;

int main()

{

cin>>n;

memset(ans,0,sizeof(ans));

for(int i=1;i<=n;i++)

	{

	cin>>s;

	if(s[0]=='A')ans[1]++;

	if(s[0]=='W')ans[2]++;

	if(s[0]=='T')ans[3]++;

	if(s[0]=='R')ans[4]++;

	}

cout<<"AC x "<<ans[1]<<endl;

cout<<"WA x "<<ans[2]<<endl;

cout<<"TLE x "<<ans[3]<<endl;

cout<<"RE x "<<ans[4]<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.203434027999065x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

map<string,int> mp;

int main(){

	std::ios::sync_with_stdio(false);

	cin.tie(0);

	int n;

	cin>>n;

	string s;

	mp["AC"] = 0; mp["WA"] = 0; mp["RE"] = 0; mp["TLE"] = 0;

	for(int i=0;i<n;i++){

		cin>>s;

		mp[s]++;

	}

	cout<<"AC"<<" x "<<mp["AC"]<<endl;

	cout<<"WA"<<" x "<<mp["WA"]<<endl;

	cout<<"TLE"<<" x "<<mp["TLE"]<<endl;

	cout<<"RE"<<" x "<<mp["RE"]<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.341280371106386x):
#include <stdio.h>

#include <string.h>



int main() {

	int a;

	

	scanf("%d", &a);

	

	char b[a+1];

	int ac = 0, wa = 0, tle = 0, re = 0;

	

	for(int i = 0; i < a; i++) {	

		

		scanf("%s", &b);

		

		

		if(b[0] == 'A') {

		

			ac++;

		}

		else if(b[0] == 'W') {

			

			wa++;

		}

		else if(b[0] == 'T') {

			

			tle++;

		}

		else if(b[0] == 'R') {

			

			re++;

		}

	}

	printf("AC x %d\n", ac);

	printf("WA x %d\n", wa);

	printf("TLE x %d\n", tle);

	printf("RE x %d\n", re);

	

	return 0;

}