stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:


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

}






// Faster C++ solution for the same problem (measured speedup: 5.253650411456974x):
#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;

}
// Slower C++ solution:
#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;

}


// Faster C++ solution for the same problem (measured speedup: 5.213354703954049x):
#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;

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

#include <string>



using namespace std;



int main()

{

    int arr_size, AC_count = 0, WA_count = 0, TLE_count = 0, RE_count = 0;

    string array[100000], in;

    cin >> arr_size;

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

        cin >> array[i];

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

    {

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

            AC_count++;

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

            WA_count++;

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

            TLE_count++;

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

            RE_count++;

    }

    cout << "AC x " << AC_count << endl << "WA x " << WA_count << endl << "TLE x " << TLE_count << endl << "RE x " << RE_count << endl;

}




// Faster C++ solution for the same problem (measured speedup: 22.92205622117142x):
#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;

}
// Slower C++ solution:
#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;

}


// Faster C++ solution for the same problem (measured speedup: 5.255688356396198x):
#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;

}
// Slower C++ solution:
#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;

}


// Faster C++ solution for the same problem (measured speedup: 5.210108496997476x):
#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;

}
// Slower C++ solution:
#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;

}

// Faster C++ solution for the same problem (measured speedup: 5.257774167657838x):
#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;

}
// Slower C++ solution:
#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;

   }

}

// Faster C++ solution for the same problem (measured speedup: 5.3201449527622255x):
#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;

}
// Slower C++ solution:
#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;

}


// Faster C++ solution for the same problem (measured speedup: 5.257111291617108x):
#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;

}
// Slower C++ solution:


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

}


// Faster C++ solution for the same problem (measured speedup: 5.246537669345247x):
#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;

}
// Slower C++ solution:
#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";

	}

}

// Faster C++ solution for the same problem (measured speedup: 5.268298473112665x):
#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;

}
// Slower C++ solution:
#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;

}

// Faster C++ solution for the same problem (measured speedup: 5.319367487646621x):
#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;

}
// Slower C++ solution:
#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";

}

// Faster C++ solution for the same problem (measured speedup: 5.275953216713566x):
#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;

}
// Slower C++ solution:
#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;

}

// Faster C++ solution for the same problem (measured speedup: 22.872709427248026x):
#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;

}
// Slower C++ solution:
#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;

}


// Faster C++ solution for the same problem (measured speedup: 5.2506169437111385x):
#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;

}
// Slower C++ solution:
///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;

}


// Faster C++ solution for the same problem (measured speedup: 5.212590776788218x):
#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;

}
// Slower C++ solution:
#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;

}


// Faster C++ solution for the same problem (measured speedup: 5.247624089814627x):
#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;

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

using namespace std;



using ll = long long;

using ull = unsigned long long;

using ld = long double;



#define MOD 1000000007LL



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

#define rep2(i, s, e) for(ll (i) = (ll)(s);(i) < (ll)(e);(i)++)

#define repi(i, n) for(ll (i) = 0LL;(i) <= (ll)(n);(i)++)

#define repi2(i, s, e) for(ll (i) = (ll)(s);(i) <= (ll)(e);(i)++)

#define per(i, n) for(ll (i) = (ll)(n) - 1LL;(i) >= 0LL;(i)--)

#define per2(i, s, e) for(ll (i) = (ll)(s) - 1LL;(i) >= (ll)(e);(i)--)

#define peri(i, n) for(ll (i) = (ll)(n);(i) >= 0LL;(i)--)

#define peri2(i, s, e) for(ll (i) = (ll)(s);(i) >= (ll)(e);(i)--)

#define iter(i, it) for(auto &(i): (it))



template<typename T, typename U> ostream& operator<<(ostream &s, const pair<T, U> m) {

    cout << "(" << m.first << ", " << m.second << ")";

    return s;

}

template<typename T, typename U> ostream& operator<<(ostream &s, const map<T, U> m) {

    ll c = 0;

    cout << "{ ";

    iter(i, m) cout << i << (c++ == m.size() - 1 ? " " : ", ");

    cout << "}";

    return s;

}

template<typename T> ostream& operator<<(ostream &s, const vector<T> &v) {

    cout << "{ ";

    rep(i, v.size()) cout << v[i] << (i == v.size() - 1 ? " " : ", ");

    cout << "}";

    return s;

}

template<typename T> ostream& operator<<(ostream &s, const list<T> &v) {

    ll c = 0;

    cout << "{ ";

    iter(i, v) cout << i << (c++ == v.size() - 1 ? " " : ", ");

    cout << "}";

    return s;

}



int main(void) {

    ll N;

    cin >> N;

    map<string, ll> m;

    rep(i, N) {

        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;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 4.709823581656361x):
#define _CRT_SECURE_NO_WARNINGS

#include<stdio.h>



int main(){

    int i;

    int n;

    char s[100001][8];

    int ac, wa, tle, re;

    ac = wa = tle = re = 0;



    scanf("%d", &n);

    for(i = 0;i < n;i++) scanf("%s", s[i]);



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

        switch(s[i][0]){

            case 'A':

                ac++;

                break;

            case 'W':

                wa++;

                break;

            case 'T':

                tle++;

                break;

            case 'R':

                re++;

                break;

        }

    }



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



    return 0;

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

using namespace std;



int main(){



    int n;

    cin >> n;



    string s[100000];



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

        cin >> s[i];



    //count関数:範囲内で完全一致する個数を調べる

    //参考:https://cpprefjp.github.io/reference/algorithm/count.html

    cout << "AC x " <<count(s, s + n, "AC") << endl;

    cout << "WA x " << count(s, s + n, "WA") << endl;

    cout << "TLE x " << count(s, s + n, "TLE") << endl;

    cout << "RE x " << count(s, s + n, "RE") << endl;

}

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

using namespace std;



int main(){

    int n;

    cin >> n;



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

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

        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;

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

using namespace std;

#define oo (long long)1e18

#define ll long long

#define setdp memset(dp,-1,sizeof(dp))

const ll mod = 1e9+7;

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

#define PI 3.14159265359

int n,l,r,x;

    vector<int>b(200009),a(200009);

int main()

{

    map<string,int>mp;

    cin>>n;

    while(n--)

    {

        string s;

        cin>>s;

        mp[s]++;

    }

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

    {

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

    }

}


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

#include<map>

#include<fstream>

#include<vector>

using namespace std;

int main()

{

	

	int t;

	string inputs;

	

	cin >> t;



	map<string, int> freq;

	freq.emplace("AC", 0);

	freq.emplace("WA", 0);

	freq.emplace("TLE", 0);

	freq.emplace("RE", 0);



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

		cin >> inputs;

		if (freq.end() != freq.find(inputs)) {

			freq.find(inputs)->second++;

		}



	}

		

	

		cout <<freq.find("AC")->first << " x " << freq.find("AC")->second<< endl;

		cout << freq.find("WA")->first << " x " << freq.find("WA")->second << endl;

		cout << freq.find("TLE")->first << " x " << freq.find("TLE")->second << endl;

		cout << freq.find("RE")->first << " x " << freq.find("RE")->second << endl;



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

using namespace std;

#define oo (long long)1e18

#define ll long long

#define setdp memset(dp,-1,sizeof(dp))

const ll mod = 1e9+7;

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

#define PI 3.14159265359

int n,l,r,x;

    vector<int>b(200009),a(200009);

int main()

{

    map<string,int>mp;

    cin>>n;

    while(n--)

    {

        string s;

        cin>>s;

        mp[s]++;

    }

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

    {

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

    }

}


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

 

using namespace std;

 

#define fastIO ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

#define forp(a,b,c) for(int (a)=(b); (a)<(c); (a++))

#define form(a,b,c) for(int (a)=(b); (a)>(c); (a--))

#define fori(a,b) for(auto (a):(b))

#define pb(a) push_back(a)

#define INF ((unsigned) ~0)

#define endl "\n"

typedef long long ll;

typedef vector<int> vi;

typedef vector<ll> vl;

typedef pair<int,int> pii;

ll gcd(ll a, ll b) {return b ? gcd(b, a%b) : a;}

 

int main()

{

    fastIO

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

    string s;

    cin>>n;

    while(n--)

    {

        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;

}