stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int n;

string s;

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

int main()

{

	cin>>n;

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

	{

		cin>>s;

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

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

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

		else              c4++;

	}

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

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

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

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

	return 0;

}

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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

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

#define ll long long

using namespace std;



const char* s[5]={"","AC","WA","TLE","RE"};

int a[10],n;

char st[10];



int main() {

	scanf("%d",&n);

	a[1]=a[2]=a[3]=a[4]=0;

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

		scanf("%s",st);

		if (st[0]=='A') a[1]++;

		if (st[0]=='W') a[2]++;

		if (st[0]=='T') a[3]++;

		if (st[0]=='R') a[4]++;

	}

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

		printf("%s x %d\n",s[i],a[i]);

	}

}

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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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 <algorithm>

#include <cmath>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <string>

using namespace std;

typedef long long ll;



const int maxn = 1e5 + 5;

int c[5];



int main() {

    int n;

    cin>>n;

    string s;

    while(n-->0){

        cin>>s;

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

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

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

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

    }

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

    return 0;

}

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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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:
//

//  main.cpp

//  B - Judge Status Summary

//

//  Created by 李远铄 on 2020/8/7.

//  Copyright © 2020 李远铄. All rights reserved.

//



#include <iostream>

#include <string>



#define _DEBUG_

#ifdef _DEBUG_

#define debug(x) cout << #x << ": " << x << "  "

#define print_n printf("\n")

#define cout_n cout<<'\n'

#else

#define debug(x)

#define print_n

#define cout_n

#endif





using namespace std;

char s[10];

int a,w,t,r;

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

    int n;

    scanf("%d",&n);

    while(n--){

        scanf("%s",s);

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

            a++;

        }else if(s[0]=='W'){

            w++;

        }else if(s[0]=='T'){

            t++;

        }else if(s[0]=='R'){

            r++;

        }

    }

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

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

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

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

    return 0;

}


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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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 Allah */

#include<bits/stdc++.h>

using namespace std;

int main()

{

	int t;

	cin >> t;

	map<string, int>m;

	while (t--)

	{

		string x;

		cin >> x;

		m[x]++;

	}

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

	return 0;

}










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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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() {

    cin.tie(0);

    cout.tie(0);

    ios_base::sync_with_stdio(0);



    int n;

    cin >> n;

    map<string, int> mp;

    string s;



    while (n--) {

        cin >> s;

        ++mp[s];

    }

    vector<string> v = {"AC", "WA", "TLE", "RE"};

    for (auto i : v) {

        cout << i << " x " << mp[i] << '\n';

    }





}

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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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,a=0,b=0,c=0,t=0;

    cin>>n;

    string s;

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

    {

        cin>>s;

        if(s=="AC")

        {

            a++;

        }

        if(s=="TLE")

        {

            t++;

        }

        if(s=="WA")

        {

            b++;

        }

        if(s=="RE")

        {

            c++;

        }

    }

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

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

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

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

    return 0;

}


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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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()

{

string x;



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



cin>>n;

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

cin>>x;

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

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

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

else if(x=="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.250696748827481x):
#include <stdio.h>

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

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

    if (N<=0 || N>100000){return 0;}

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

        cin >> entr;

        if (entr == "AC") {

            AC ++;

        }

        if (entr == "WA"){

            WA++;

        }

        if (entr == "TLE"){

            TLE++;

        }

        if (entr == "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.251945825061705x):
#include <stdio.h>

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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<vector>

using namespace std;

int main()

{

	int n;

	cin >> n;

	string s;

	vector<pair<string, int>>v;

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

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

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

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

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

	{

		cin >> s;

		if (s == "AC")

			v[0].second++;

		else if (s == "WA")

			v[1].second++;

		else if (s == "TLE")

			v[2].second++;

		else if (s == "RE")

			v[3].second++;

	}

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

	{

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

		if (i < 3)

		{

			cout << endl;

		}

	}

	return 0;

}

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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

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

#include<vector>

 int main()

   {

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

    int n;

    cin>>n;

    string s;

    while(n--)

      {

        cin>>s;

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

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

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

       if(s=="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.2516280013331205x):
#include <stdio.h>

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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 <algorithm>

#include <string>

#define ll long long

using namespace std;

int main(){

    string s;

    ll n;

    string ac="AC";

    ll cac=0;

    string wa="WA";

    ll cwa=0;

    string tle="TLE";

    ll ctle=0;

    string re="RE";

    ll cre=0;

    cin>>n;

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

        cin>>s;

        if(s==ac){

            cac++;

        }

        else if(s==wa){

            cwa++;

        }

        else if(s==tle){

            ctle++;

        }

        else if (s==re){

            cre++;

        }

    }

    cout<<ac<<" x "<<cac<<endl;

    cout<<wa<<" x "<<cwa<<endl;

    cout<<tle<<" x "<<ctle<<endl;

    cout<<re<<" x "<<cre<<endl;

}

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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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 <vector>

#include <algorithm>



using namespace std;



int main()

{

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

    string s;



    cin >> n;

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

    {

        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 << "\nWA x " << WA << "\nTLE x " << TLE << "\nRE x " << RE << endl;

    return 0;

}


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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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 <map>

#include <queue>

#include <vector>

#include<algorithm>

#include <set>

#include <stdlib.h>



using namespace std;



int main()

{

    map<string,int>m;

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

    int n;

    string arr;

    cin>>n;

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

    {

        cin>>arr;

        m[arr]++;

    }

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

        {cout<<a[i]<<" x "<<m[a[i]]<<endl;}

    return 0;

}


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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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 if(s=="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.25115368081417x):
#include <stdio.h>

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

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

    cin>>n;

    string s[n];

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

    {

        cin>>s[i];

    }

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

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

    {

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

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

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

        else if (s[i] == "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.208142180232137x):
#include <stdio.h>

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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 <cstring>



using namespace std ;

int main ()

{

  int N ,x=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")

x=x+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 "<< x <<endl;

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

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

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

    return 0 ;

}






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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

        else if (verdict[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 <cstring>



using namespace std;



int main()

{

    int N; cin >> N;

    int ctr = 0;

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

    char input[6];

    do

    {

        cin >> input;

        ctr++;

        if (strcmp(input,"AC") == 0)

        {

            c0++;

        }

        else if (strcmp(input,"WA") == 0)

        {

            c1++;

        }

        else if (strcmp(input,"TLE") == 0)

        {

            c2++;

        }

        else if (strcmp(input,"RE") == 0)

        {

            c3++;

        }

    } while ( ctr < N);

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

#include <string.h>

int main(){

    int tc;

    scanf("%d", &tc);

    int ac = 0;

    int wa = 0;

    int tle = 0;

    int re = 0;

    int i;

    for( i = 0; i < tc ; i++){

        char verdict[100];

        scanf("%s", verdict);

        int length = strlen(verdict);

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

            ac++;

        }

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

            wa++;

        }

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

            tle++;

        }

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

}