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

#include <string>

using namespace std;



int main()

{

    long long int n;

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



    cin>>n;



    string S[n];

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

        cin>>S[i];

    }



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

        if(S[j] == "AC"){AC++;}

        else if(S[j] == "WA"){WA++;}

        else if(S[j] == "TLE"){TLE++;}

        else if(S[j] == "RE"){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.250062782278785x):
#include<stdio.h>

#include<string.h>



int main(){

    

	int input;

	int ACc = 0;

	int WAc = 0;

	int TLEc = 0;

	int REc = 0;

	char inputted[100];

	

	scanf("%d", &input);

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

		scanf("%s", inputted);

		if('A' == inputted[0])

		{

			ACc++;

		}

		else if('W' == inputted[0])



		{

			WAc++;

		}

		else if('T' == inputted[0])

		{

			TLEc++;

		}

		else if('R' == inputted[0])

		{

			REc++;

		}

	}

	

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

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

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

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

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

#define ll long long

using namespace std;

int main(){

	ll n;

	map<string,ll>m;

	cin >> n;

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

		string s;

		cin >> s;

		m[s]++;

	}

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

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

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

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

}

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

#include<string.h>



int main(){

    

	int input;

	int ACc = 0;

	int WAc = 0;

	int TLEc = 0;

	int REc = 0;

	char inputted[100];

	

	scanf("%d", &input);

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

		scanf("%s", inputted);

		if('A' == inputted[0])

		{

			ACc++;

		}

		else if('W' == inputted[0])



		{

			WAc++;

		}

		else if('T' == inputted[0])

		{

			TLEc++;

		}

		else if('R' == inputted[0])

		{

			REc++;

		}

	}

	

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

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

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

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

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

#include <algorithm>

#include <cstring>

#include <string>

#include <cmath>

#include <set>

#include <unordered_set>

#include <vector>

#include<valarray>

#include<map>

#include <bits/stdc++.h>

#include <utility>

#include<bits/stdc++.h>

int a[4];

using namespace std;



int main()

{

int t;

cin>>t;

string s;

while (t--)

{

    cin>>s;

    if(s=="AC")

    {

        a[0]++;

    }

    if(s=="WA")

    {

        a[1]++;

    }

    if(s=="TLE")

    {

        a[2]++;

    }

    if(s=="RE")

    {

        a[3]++;

    }



}

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

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

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

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





    return 0;

}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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 t, wa=0 ,tle=0, ac=0 ,re=0; cin>>t;



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

	{

		string s; cin>>s;

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

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

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

		else wa++;



	}

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

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

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

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









}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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 <cmath>

#include <algorithm>

#include <cstdlib>

using namespace std;



int main() {

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

    scanf("%d",&x);

    string s;

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

        cin>>s;

        if(s=="AC")

            a++;

        else if (s=="WA")

        b++;

        else if(s=="TLE")

            c++;

        else if(s=="RE")

            d++;

    }

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



}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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;

/*  Writen by : AS7

 *  "JUST KEEP GOING..."

 */

#define endl			'\n'

#define ll				long long

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

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

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

#define clr(v, d)		memset(v, d, sizeof(v))

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

#define For(i,s)        for(auto i:s)

#define Forr(i,s)        for(auto &i:s)

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

#define lpi(i, j, n)	for(int i=(j);i<(int)(n);++i)

#define lpd(i, j, n)	for(int i=(j);i>=(int)(n);--i)

#define vi				vector <int>

#define vl				vector <ll>

#define ii				pair <int,int>

#define vii				vector <ii>

#define vll				vector <pair<ll,ll>>

#define PI				double PPPPPP = 3.14159265358979323846;

#define bit(mask,i) ((mask>>i)&1)

const int N = 2e5+5;

map<string ,int > freq;

void solve(){

   int n;

   cin>>n;

   lp(i,n){

       string s;

       cin>>s;

       freq[s]++;

   }

   cout<<"AC x "<<freq["AC"]<<"\n"<<"WA x "<<freq["WA"]<<"\n"<<"TLE x "<<freq["TLE"]<<"\n"<<"RE x "<<freq["RE"]<<endl;



}

int main() {

    int t = 1;

  //  cin>>t;

    while (t--)solve();

}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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;

//AC, WA, TLE, or RE.

int main()

{

    string a[] = {"AC", "WA", "TLE", "RE"};

    int res[] = {0,0,0,0};

    int x;

    cin >> x;

    string n;

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

    {

        cin >> n;

        for (int j = 0; j < 4; j++)

        {

            if (a[j] == n)

            {

                res[j]++;

            }

        }

    }

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

    {

        cout << a[i] << " x " << res[i] << endl; 

    }

}


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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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() {

    string AC , WA, TLE, RE;

    string x;

    int n;

    cin>>n;

    int cnt1=0;

    int cnt2=0;

    int cnt3=0;

    int cnt4=0;

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

        cin>>x;

        if(x== "AC"){++cnt1;}

        if(x== "WA"){++cnt2;}

        if(x== "TLE"){++cnt3;}

        if(x== "RE"){++cnt4;}

    }

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

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

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

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



    return 0;

}


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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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<bits/stdc++.h>



using namespace std;



int main()

{

    int n;

    cin>>n;

    map<string,int>tmp;





    tmp["AC"]=0;

    tmp["WA"]=0;

    tmp["TLE"]=0;

    tmp["RE"]=0;



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

    {

        string s;cin>>s;



        tmp[s]++;

    }



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

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

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

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

    return 0;

}


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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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;

    cin>>n;

    int a[4]={0};

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

        string s;

        cin>>s;

        if(s=="AC")

            a[0]+=1;

        else if(s=="WA")

            a[1]+=1;

        else if(s=="TLE")

            a[2]+=1;

        else

            a[3]+=1;

    }





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

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

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

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















}


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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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;

void init(){

    cin.tie(0);

    cin.sync_with_stdio(0);

}

int fr[205];

int main()

{   init();

    int n;

    cin>>n;

    map<string ,int>mp;

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

        string s;

        cin>>s;

        mp[s]++;}

        cout<<"AC x "<<mp["AC"]<<endl<<"WA x "<<mp["WA"]<<endl<<"TLE x "<<mp["TLE"]<<endl<<"RE x "<<mp["RE"];



}


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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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<bits/stdc++.h>

using namespace std;



int main() {

int n;

cin>>n;

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

while(n--){

	string s;

	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.239626100466579x):
#include <stdio.h>

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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>

#define ll long long

using namespace std;



int main()

{

    int n;cin>>n;

    string s;

    string arr[4]={"AC" , "WA" ,"TLE" ,"RE" };

    int intarr[4]={};

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

    {

        cin>>s;

        if(s=="AC")

            intarr[0]++;

        else if(s=="WA")

            intarr[1]++;

        else if(s=="TLE")

            intarr[2]++;

        else intarr[3]++;

    }

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

    {

        cout<<arr[i]<<" x "<<intarr[i]<<endl;

    }

    return 0;

}


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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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:
// 2nd.cpp : This file contains the 'main' function. Program execution begins and ends there.

//



#include <iostream>

#include<string>

#include<vector>

using namespace std;



int main()

{

	int n;

	cin >> n;

	int a = 0;

	int b = 0;

	int c = 0;

	int d = 0;



	vector<string> ans(n);

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

	{

		cin >> ans[i];

		if (ans[i] == "AC")

			a++;

		else if (ans[i] == "WA")

			b++;

		else if (ans[i] == "TLE")

			c++;

		else

			d++;





	}

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

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

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

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





	return 0;



}



// Run program: Ctrl + F5 or Debug > Start Without Debugging menu

// Debug program: F5 or Debug > Start Debugging menu



// Tips for Getting Started: 

//   1. Use the Solution Explorer window to add/manage files

//   2. Use the Team Explorer window to connect to source control

//   3. Use the Output window to see build output and other messages

//   4. Use the Error List window to view errors

//   5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project

//   6. In the future, to open this project again, go to File > Open > Project and select the .sln file


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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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 i = 0, j = 1;

    cout << i;

    int *ptr = &i;

    cout << i;



    i = 2;

    cout << i;

    *ptr = 3;

    ptr = &j;

    j = i;

    cout << i;

    *ptr = 4;

      /*/



    /*/

    int n , ctn=0 ,arr;

    cin >> n ;

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

        cin >> arr;



        if ((i%2!=0)&&(arr%2!=0))ctn++;



    }

    cout<<ctn <<endl;



    cout << "Hello, world!"<<endl;

    cout << "Greetings from Illinois!" <<endl;

    /*/



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

    string inp;

    cin >> n ;

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

    {

        cin >> inp;

        if (inp =="AC") ac++;

        if (inp=="WA") wa++;

        if (inp=="TLE") tle++;

        if (inp=="RE") re++;



    }

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

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

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

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





    

}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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;



map<string, int> mp;

int main() {

    int n;

    cin >> n;

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

        string s;

        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;



    return 0;

}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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;

char st[10];

int n;

map <string,int> mp;

int main(){

//	freopen("x.txt","r",stdin);

	scanf("%d\n",&n);

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

		cin>>st;

//		cout<<st<<endl;

		mp[st]++;

	}

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

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

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

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

	return 0;

}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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;

const int MAXN = 1e5 + 5;



int a, b, c, d;

char str[500];



int main(int argc, char* argv[]) {

    int T;

    scanf("%d", &T);

    while (T--) {

        scanf("%s", str);

        if (str[0] == 'A')

            a++;

        else if (str[0] == 'W')

            b++;

        else if (str[0] == 'T')

            c++;

        else if (str[0] == 'R')

            d++;

    }

    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.121612794841648x):
#include <stdio.h>

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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 <cmath>



using namespace std;



int main()

{

  int N ;

  cin >> N ;

  string S[N] ;

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

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

  {

    cin >> S[i] ;

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

        c0++;

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

        c1++;

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

        c2++;

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

        c3++;



  }



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

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

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

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



    return 0;

}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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, b =0, c = 0,d = 0,e = 0;

	string a;

	cin >> n;

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

		cin >> a;

		if (a[0] == 'A')

			b++;

		else if (a[0] == 'T' )

			c++;

		else if (a[0] == 'W')

			d++;

		else {

			e++;

		}

	}cout << "AC x "<< b << endl;

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

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

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

	

	return 0;

}

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

#include <string.h>

int main(){

int n;

scanf("%d",&n);

char judge[n]={};

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

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

	scanf("%s",judge);

	if(strcmp(judge,"AC")==0){

		ac++;

	}

	else if(strcmp(judge,"TLE")==0){

		tle++;

	}

	else if(strcmp(judge,"WA")==0){

		wa++;

	}

	else if(strcmp(judge,"RE")==0){

		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;

}