stablegradients/pie-gem5-bysrc huggingface dataset:
// Original C++ solution (slower):
#include <iostream>



using namespace std;





int main()

{

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

string stats;

cin>>n;

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

    cin>>stats;

    if(stats=="AC"){ac++;}

    else if(stats=="WA"){wa++;}

    else if(stats=="RE"){re++;}

    else if(stats=="TLE"){tle++;}



}

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

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

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

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

    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <vector>

#include <queue>

#include <algorithm>

#include <cmath>

#include <map>

#include <stdio.h>

#define IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

#define ll long long

#define pie 3.141592653



using namespace std;





int main()

{

	IO;



	int n;

	string s;

	vector <pair<string, int>>vp;

	vp.push_back(make_pair("AC", 0));

	vp.push_back(make_pair("WA", 0));

	vp.push_back(make_pair("TLE", 0)); 

	vp.push_back(make_pair("RE", 0));

	cin >> n;



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

	{

		cin >> s;

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

		{

			if (vp[j].first == s)

			{

				vp[j].second++;

				break;

			}

		}

	}

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

	{

		cout << vp[i].first << " x " << vp[i].second;

		if (i < 3)

			cout << "\n";

	}

	return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include<map>



using namespace std;



int main()

{

    int n;

    cin>>n;

    map<string,int>mymap;

    char str[100];

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

        cin>>str,mymap[str]++;

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

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

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

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



    return 0;

}

// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std;

int main(){

    int tc;cin>>tc;

    int acCount,waCount,tleCount,reCount;

    acCount = waCount = tleCount = reCount = 0;

    while(tc > 0){

        char arr[4];

        cin>>arr;

        if(arr[0] == 'A' && arr[1] == 'C')

            acCount++;

        else if(arr[0] == 'W' && arr[1] == 'A')

            waCount++;

        else if(arr[0] == 'R' && arr[1] == 'E')

            reCount++;

        else

            tleCount++;

        tc--;

    }

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

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

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

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

    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>



using namespace std;



int main()

{

    int n;

    cin>>n;

    string s;

    int arr[4]={0};

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

        cin>>s;

        if (s=="AC")

            arr[0]++;

        else if (s=="WA")

            arr[1]++;

        else if (s=="TLE")

            arr[2]++;

        else

            arr[3]++;

    }

    cout<<"AC x "<<arr[0]<<"\n";

    cout<<"WA x "<<arr[1]<<"\n";

    cout<<"TLE x "<<arr[2]<<"\n";

    cout<<"RE x "<<arr[3];



    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#define ll long long int



#include <bits/stdc++.h>



using namespace std;



int main() {



 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;

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

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

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





    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <string>

using namespace std;



int main ()

{

    int N{};

    cin >> N;

    

    string Si[N];

    for (int i{}; i<N; i++) 

        {

            cin >> Si[i];

        }

    int C[4] {0,0,0,0};

    for (auto i : Si) 

        {

            if (i == "AC")

                C[0] += 1;

            if (i == "WA")

                C[1] += 1;

            if (i == "TLE")

                C[2] += 1;

            if (i == "RE")

                C[3] += 1;

        }

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

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

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

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

        

	return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):


#include <iostream>

#include <string>

#include <vector>

#include <algorithm>

#import<iostream>

#include <bits/stdc++.h>

using namespace std;



int main()

{

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

    int C0=0,C1=0,C2=0,C3=0;

    int N;

    cin>>N;

    string arr_2[N];

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

    {

        cin>>arr_2[i];



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

            C0+=1;

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

            C1+=1;

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

            C2+=1;

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

            C3+=1;

    }



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

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

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

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









    return 0;

}






// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <algorithm>

using namespace std;



int main()

{

   int n,c=0,w=0,t=0,r=0;

   cin>>n;

   string a[n];

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

    cin>>a[i];

   }

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

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

        c++;

    }

    else if(a[i]=="WA"){

        w++;

    }

    else if(a[i]=="TLE"){

        t++;

    }

    else if(a[i]=="RE"){

        r++;

    }

   }

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

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

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

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







    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include<bits/stdc++.h>

using namespace std;



int main()

{

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

int T;

cin>>T;

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

{

    string s;

    cin>>s;

 if(s=="AC")

        AC++;

 else if(s=="WA")

    WA++;

 else if(s=="TLE")

    TLE++;

 else if(s=="RE")

    RE++;



}

cout<<"AC x "<<AC<<endl<<"WA x "<<WA<<endl<<"TLE x "<<TLE<<endl<<"RE x "<<RE<<endl;

    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <cstring>



using namespace std;



int main()

{

    int n, c0, c1, c2, c3, sVal;

    c0 = c1 = c2 = c3 = 0;

    cin >> n;

    char c [4];

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

        cin >> c;

        sVal = strcmp(c, "RE");

        if ( sVal ==0) c3++;

        else if(sVal < 0) c0++;

        else {

            if (strcmp(c, "WA")==0) c1++;

            else c2++;

        }

    }

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

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

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

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



    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <cstring>

using namespace std;

int main()

{

    int N, t = 0, y = 0, z = 0, c = 0, i;

    cin >> N;

    string a[N];

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

        cin >> a[i];

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

            t = t + 1;

        if (a[i] == "WA")

            y = y + 1;

        if (a[i] == "TLE")

            z = z + 1;

        if (a[i] == "RE")

            c = c + 1;

    }

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

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

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

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

    return 0;

}

// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;



int main() {

   int N;

   cin >> N;

   map<string, int> ans;

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

       string s;

       cin >> s;

       ans[s]++;

   }

   for (string s: {"AC", "WA", "TLE", "RE"}) {

       cout << s << " x " << ans[s] << endl;

   }

}

// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

using namespace std;

int main() {

    int n;

    int a=0,w=0,t=0,r=0;

    cin >>n;

    string arr[n];

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

        cin>>arr[i];

        if(arr[i]=="AC"){a++;}

        else if (arr[i]=="WA"){w++;}

        else if (arr[i]=="TLE"){t++;}

        else if (arr[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;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):


#include <iostream>

#include <string>

using namespace std;



int  main() {

	int x, q = 0, w = 0, e = 0, r = 0;

	string a = "AC", b = "WA", c = "RE", t = "TLE",m;

	cin >> x;

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

	{

		cin >> m;

		if (m==a)

		{

			q++;

		}

		else if (m == b) {

			w++;

		}

		else if (m == t) {

			e++;

		}

		else if (m == c) {

			r++;

	}

	}

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

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

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

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

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;

int main()

{

	map<string, int> m;

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

	int n;

	cin>>n;

	while (n--)

	{

		string s;

		cin>>s;

		m[s]++;

	}

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

	{

		cout<<ar[i]<<" x "<<m[ar[i]]<<"\n";

	}

}

// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include<bits/stdc++.h>

typedef long long ll;

using namespace std;

int main()

{

	ios_base::sync_with_stdio(0);

	cin.tie(0);cout.tie(0);

	ll n,a=0,b=0,c=0,d=0;

	string s;

	cin >> n;

	while(n--){

		cin >> s;

		if(s=="AC"){

			a++;

		}

		else if(s=="TLE"){

			b++;

		}

		else if(s=="WA"){

			c++;

		}

		else if(s=="RE"){

			d++;

		}

	}

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

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

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

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

}

// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;



int N;

int arr[5];

string str;



int main() {

	

	ios_base::sync_with_stdio(false);

	cin >> N;

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

		cin >> str;

		if(str == "AC") arr[1]++;

		else if(str == "WA") arr[2]++;

		else if(str == "TLE") arr[3]++;

		else if(str == "RE") arr[4]++;

	}

	cout << "AC x " << arr[1] << "\n";

	cout << "WA x " << arr[2] << "\n";

	cout << "TLE x " << arr[3] << "\n";

	cout << "RE x " << arr[4] << "\n";

}

// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>

#include <cmath>

#include <string>

using namespace std;

int main()

{

	string arr[100000];

	int countAC = 0, countTLE = 0, countWA = 0 , countRE=0;

	int num;

	cin >> num;

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

	{

		cin >> arr[i];

	}

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

	{

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

			countAC++;

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

			countTLE++;

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

			countWA++;

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

			countRE++;



	}

	cout << "\nAC"<<" "<<"x"<<" " << countAC;

	cout << "\nWA" << " " << "x" <<" "<< countWA;

	cout << "\nTLE"<<" "<<"x" << " " << countTLE;

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

	return 0;

}

// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <iostream>



using namespace std;



int main()

{

    int N = 0 , 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 << "\n"

         << "WA x " << WA << "\n"

         << "TLE x "<< TLE<< "\n"

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

    return 0;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
///In the name of Almighty Allah(swt).



#include<bits/stdc++.h>

#define ll long long int

using namespace std;

int main()

{

    int n,i,a=0,w=0,t=0,r=0;

    cin>>n;

    string s[n];

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

    {

        cin>>s[i];

    }

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

    {

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

            a++;

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

            t++;

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

            w++;

        else 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;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem:
// Original C++ solution (slower):
#include <bits/stdc++.h>

using namespace std;

int main (){

    int n,a[4]={0};

    string s;

    cin >> n;

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

        cin >> s;

        switch (s[0]){

        case 'A':

            a[0]++;

            break;

        case 'W':

            a[1]++;

            break;

        case 'T':

            a[2]++;

            break;

        case 'R':

            a[3]++;

            break;

        }

    }

    cout << "AC x " << a[0] << endl << "WA x " << a[1] << endl << "TLE x " << a[2] << endl << "RE x " << a[3] << endl;

}


// Optimized solution to the same problem (faster):
#include<stdio.h>



int main(){

	int N;

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

	scanf("%d", &N);

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

		char msg[5];

		scanf("%s", msg);

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

			c1++;

		}

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

			c2++;

		}

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

			c3++;

		}

		else{

			c4++;

		}

	}

	printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d\n", c1, c2, c3, c4);

	return 0;

}

// Fastest known solution for this problem: