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



using namespace std;



int main()

{

int n,A=0,B=0,C=0,D=0;

cin>>n;

string s;

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

    cin>>s;

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

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

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

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

}

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

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

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

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

    return 0;

}


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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

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

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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

#include <string>

using namespace std;

int main() {



	long long n;

	string x;

	cin >> n;



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



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

	{

		cin >> x;

		

		if (x == "AC")

			AC++;

		else if (x == "WA")

			WA++;

		else if (x == "TLE")

			TLE++;

		else if (x == "RE")

			RE++;





	}



	cout << "AC x " << AC;

	cout << endl;

	cout << "WA x " << WA;

	cout << endl;

	cout << "TLE x " << TLE;

	cout << endl;

	cout << "RE x " << RE;

}

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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

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

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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



using namespace std;



int main()

{

    int n;

    cin>>n;

    string s[n];

    int a,w,t,r;

    a=w=t=r=0;

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

        cin>>s[i];

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

           a++;

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

            w++;

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

            t++;

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

            r++;

    }



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

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

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

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

    return 0;

}


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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

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

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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

#include <map>



using namespace std;



int main()

{

    int n;

    cin>>n;

    map<string,int> counter;



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

    {

        string temp;

        cin>>temp;

        counter[temp]++;

    }



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

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

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

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



    return 0;

}


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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

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

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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

#include<string>

#include<algorithm>

#include<vector>

using namespace std;

int main()

{

	int n;

	cin >> n;

	int a, s, d, f;

	a = s = d = f = 0;

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

	{

		string x;

		cin >> x;

		if (x=="AC")

			a++;

		if (x == "WA")

			s++;

		if (x == "TLE")

			d++;

		if (x == "RE")

			f++;

	}

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

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



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

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



	return 0;

}

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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

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

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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



using namespace std;



int main()

{

	int n, C1 = 0, C2 = 0, C3 = 0, C4 = 0;

	cin>>n;

	string o;

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

     {

          cin>>o;

          if ( o == "AC" )

               C1 += 1;

          else if ( o == "WA" )

               C2 += 1;

          else if ( o == "TLE" )

               C3 += 1;

          else if ( o == "RE" )

               C4 += 1;

     }

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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

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

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

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

using namespace std;



int a;



int main() {

	map<string, int> m;

	cin>>a;

	for(int k = 1; k<= a; k++){

		string s;

		cin >> s;

		m[s] ++;

	}

	cout << "AC x " << m["AC"]<< '\n';

	cout << "WA x " << m["WA"] << '\n';

	cout << "TLE x " << m["TLE"] << '\n';

	cout << "RE x " << m["RE"]<< '\n';

}

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

#include<string.h>



int main()

{

	int n;

	int ctr[5] = {0};

	scanf("%d", &n);

	

	char str[n];

	

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

		scanf("%s", &str);

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

			++ctr[0];

		}else if(strcmp(str, "WA") == 0){

			++ctr[1];

		}else if(strcmp(str, "TLE") == 0){

			++ctr[2];

		}else if(strcmp(str, "RE") == 0){

			++ctr[3];

		}

	}

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

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

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

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

}
// Slower C++ solution:
///ataur

#include<bits/stdc++.h>



using namespace std;



int main()

{

    int n;

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

    cin>>n;

    while(n--)

    {



        char s[10];

        cin>>s;

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

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

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

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



    }

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

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

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

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

    return 0;

}






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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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



map<string , long long>m;



int main(){

 long long n,a,b,x;

 set<string>lst;

 string s;

 cin >>n;

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

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

    int cnt1=0,cnt2=0,cnt3=0,cnt4=0;

    while(n--)

    {

        string s;

        cin>>s;

        if(s=="AC")

            cnt1++;

        else if(s=="WA")

            cnt2++;

        else if(s=="TLE")

            cnt3++;

        else

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

			RE++;

		}

	}

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

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

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

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

	

	return 0;

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



using namespace std;



int main()

{

 int n;

 cin>>n;

 string s;

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

 while(n--) {

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

			RE++;

		}

	}

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

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

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

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

	

	return 0;

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



using namespace std;



int main() {

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

   cin>>n;

   string s[n];

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

        cin >> s[i];

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

            AC++;

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

            WA++;

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

            TLE++;

        else

            RE++;

    }

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

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

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

    cout<<"RE x "<<RE;

}






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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

		else if(str[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:
#pragma GCC optimize ("O3")

#include<bits/stdc++.h>

using namespace std;



/// Info.

///****************************************************************************************************************************************///

/// author                : BAHAA El-DEEN OSAMA .

/// Problem name          : A - Choose Two Numbers

/// Method                : brute force

/// Online judge          : vjudge(Contest)

/// Date                  : 8/6/2020

///****************************************************************************************************************************************///



string str;

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



int main()

{



cin>>n;

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

{

    cin>>str;

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

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

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

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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



}


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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

 

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

}

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

		else if(str[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<math.h>

#include<vector>

#include<string>

#include<algorithm>



using namespace std;



#define vi vector<int>

#define vvi vector<vi>

#define rpt(i,x) for (int i = 0; i < x; i++)

#define fti(i,f,t) for (int i = f; i <= t; i++)

#define fte(i,f,t) for (int i = f; i < t; i++)

#define rptws(i,x,s) for (int i = 0; i < x; i += s)

#define llrpt(i,x) for (long long i = 0; i < x; i++)

#define llfti(i,f,t) for (long long i = f; i <= t; i++)

#define llfte(i,f,t) for (long long i = f; i < t; i++)





int main () {

    int n;

    cin>>n;

    int arr[4] = {0};



    rpt(i, n) {

        string s;

        cin>>s;



        if (s == "AC") arr[0]++;

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

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

        else if (s == "RE") 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;

}

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

			RE++;

		}

	}

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

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

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

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

	

	return 0;

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

using namespace std;





int main()

{

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

    cin>>n;

    string s;

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

    {

        cin>>s;

        if(s=="AC")

            AC++;

        else if (s=="WA")

            WA++;

        else if (s=="TLE")

            TLE++;

        else

            RE++;

    }



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

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

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

    cout<<"RE x "<<RE;

}

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

		else if(str[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 n,test_count[4];

char test[5]={"AWTR"},s[4];



int main(){

    cin>>n;

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

        cin>>s;

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

        {

            if (s[0]==test[j])

                test_count[j]++;

        }

    }

    cout<<"AC x "<<test_count[0]<<'\n';

    cout<<"WA x "<<test_count[1]<<'\n';

    cout<<"TLE x "<<test_count[2]<<'\n';

    cout<<"RE x "<<test_count[3]<<'\n';

    return 0;

}

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

using namespace std;



int counter[4];

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



int main()

{

	string s;

	

	int n = 0; 

	cin>>n;

	

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

	   cin>>s;

	   if(s.compare(answer[0]) == 0)

	       counter[0]++;

	   else if(s.compare(answer[1]) == 0)

	       counter[1]++;

	   else if(s.compare(answer[2]) == 0)

	       counter[2]++;

	   else

	        counter[3]++;

	}

	

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

		cout<<answer[i]<<" x "<<counter[i]<<endl;

	}

	return 0;

}

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

#define INF 0x3f3f3f3f

#define maxn 100005

#define ll long long



void DBG() {

    cerr << "]\n";

}

template <class H, class... T> void DBG(H h, T... t) {

    cerr << h;

    if (sizeof...(t)) {

        cerr << ", ";

    }

    DBG(t...);

}

#define _DEBUG

#ifdef _DEBUG

#define dbg(...) cerr << "LINE(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)

#else

#define dbg(...) 0

#endif



int tt, n, k;

map<string, int> mp;



int main() {



    cin >> tt;

    while (tt--) {

        string s;

        cin >> s;

        mp[s]++;

    }

    printf("AC x %d\nWA x %d\nTLE x %d\nRE x %d", mp["AC"], mp["WA"], mp["TLE"], mp["RE"]);

    return 0;

}

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



int main(){

	

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

	char str[10];

	scanf("%d", &n);

	

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

		scanf("%s", str);

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

			AC++;

		}

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

			WA++;

		}

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

			TLE++;

		}

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

}