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

using namespace std;

char st[10];

int n;

map <string,int> mp;

int main(){

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

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

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

		cin>>st;

//		cout<<st<<endl;

		mp[st]++;

	}

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

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

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

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

	return 0;

}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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



using namespace std;

const int MAXN = 1e5 + 5;



int a, b, c, d;

char str[500];



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

    int T;

    scanf("%d", &T);

    while (T--) {

        scanf("%s", str);

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

            a++;

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

            b++;

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

            c++;

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

            d++;

    }

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

    return 0;

}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

#include <cmath>



using namespace std;



int main()

{

  int N ;

  cin >> N ;

  string S[N] ;

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

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

  {

    cin >> S[i] ;

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

        c0++;

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

        c1++;

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

        c2++;

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

        c3++;



  }



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

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

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

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



    return 0;

}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

using namespace std;

int main()

{

	int n, b =0, c = 0,d = 0,e = 0;

	string a;

	cin >> n;

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

		cin >> a;

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

			b++;

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

			c++;

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

			d++;

		else {

			e++;

		}

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

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

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

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

	

	return 0;

}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

#include<iostream>

#include<iomanip>

#include<string>

#include<cmath>

#include<algorithm>

#include<vector>

#include<stack>

#include<queue>

#include<deque>

#include<set>

#include<map>

#include<bitset>

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

#define ll long long

#define ull unsigned long long

using namespace std;

const int PI = 3.14159265;

void fast() {

	std::ios_base::sync_with_stdio(0);

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

}

int main()

{

	//freopen("file.in","r",stdin);

	//freopen("file.out","w",stdout);

	fast();



	int t;

	cin >> t;

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

	while (t--)

	{

		string s;

		cin >> s;

		if (s == "WA") {

			wa++;

		}

		else if (s == "TLE") {

			tle++;

		}

		else if (s == "RE") {

			re++;

		}

		else {

			ac++;

		}

	}

	cout << "AC x " << ac << '\n';

	cout << "WA x " << wa << '\n';

	cout << "TLE x " << tle << '\n';

	cout << "RE x " << re << '\n';



	return 0;

}


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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

#include<math.h>

#include<algorithm>

#include<map>

using namespace std;



int main()

{

    map<string, int>freq;

    int n;

    string val;

    cin >> n;



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

        cin >> val;

        freq[val] += 1;

    }



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

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

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

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

    return 0;

}


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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

#include<algorithm>

using namespace std;

int main()

{

    int n;

    cin >> n;

    string a[n];

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

    int x1=0,x2=0,x3=0,x4=0;

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

        cin >> a[i];

        if (a[i]==b[0]) {x1++;}

        else if (a[i]==b[1]) {x2++;}

        else if (a[i]==b[2]) {x3++;}

        else if (a[i]==b[3]) {x4++;}

    }

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

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

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

    cout<<"RE x "<<x4<<endl;





    return 0;

}




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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

using namespace std;

int main()

{

    long long n;

    cin >> n;

    string s;

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

    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 << "\nWA x " << wa

    << "\nTLE x " << tle << "\nRE x "<< re;



return 0;

}


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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

using namespace std;



int main()

{

	int n;

	string val;

	cin >> n;

	int count[4] = { 0 };

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

	{

		cin >> val;

		switch (val[0])

		{

		case 'A':

			count[0]++;

			break;

		case 'W':

			count[1]++;

			break;

		case 'T':

			count[2]++;

			break;

		case 'R':

			count[3]++;

			break;

		default:

			break;

		}

	}

	cout << "AC x " << count[0] << "\nWA x " << count[1] << "\nTLE x " << count[2] << "\nRE x " << count[3] << "\n";



	ios::sync_with_stdio(false);

	cin.tie();

	cout.tie();

	return 0;

}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

#include<algorithm>

#include<math.h>

 #define ll long long

using namespace std;

int main()

{

	int co1=0, co2=0, co3=0, co4=0;

    string s; int t; cin >> t;

	while (t--)

	{

		cin >> s;

		if (s == "AC")

			co1++;

		else if (s == "WA")

			co2++;

		else if (s == "TLE")

			co3++;

		else {

			co4++;

		}

		

	}

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

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

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

	cout << "RE x " << co4 << endl;

}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

using namespace std;

#define endl "\n"

#define goat() ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);srand(time(NULL))

typedef long long ll;

int a[1005]; int b[1005];

int main() {

	goat();

	int n, m, i;

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

	cin >> n;

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

		string s;

		cin >> s;

		if (s == "AC") {

			ac++;

		}

		else if (s == "TLE") {

			tle++;

		}

		else if (s=="WA") {

			wa++;

		}

		else {

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

using namespace std;

int main()

{

int n=0,c_AC=0,c_WA=0,c_TLE=0,c_RE=0;

cin>>n;

while (n>0)

{

    string s;

    cin>>s;

    if ( s[0]=='A'){c_AC++;}

    if ( s[0]=='W'){c_WA++;}

    if ( s[0]=='T'){c_TLE++;}

    if ( s[0]=='R'){c_RE++;}

    n--;

}

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

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

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

cout<<"RE x "<<c_RE<<endl;

}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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



using namespace std;



int main()

{



    int test;   cin >> test;

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



    string stat;

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



        cin >> stat;

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

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

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

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

using namespace std;



int main()

{

    long long n;

cin>>n;

    string str;

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

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

{

    cin>>str;

    transform(str.begin(), str.end(),str.begin(), ::toupper);



    if(str=="AC")

        a++;

    else if(str=="WA")

        b++;

    else if(str=="TLE")

    c++;

    else if(str=="RE")

        d++;

        else

            continue;

}

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

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

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

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



}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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



using namespace std;



int main()

{

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

    string s;

    cin>>n;

    while(n--){

        cin>>s;

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

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

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

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

#include <string>

using namespace std;



int main()

{

    long long int n;

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



    cin>>n;



    string S[n];

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

        cin>>S[i];

    }



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

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

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

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

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

    }

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

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

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

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



    return 0;

}


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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

#define ll long long

using namespace std;

int main(){

	ll n;

	map<string,ll>m;

	cin >> n;

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

		string s;

		cin >> s;

		m[s]++;

	}

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

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

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

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

}

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

#include<string.h>

int main(){

    

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

    scanf("%d", &N);

    

    char S[N][4];

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

    	scanf("%s", S[i]);

	}

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

    	if(strcmp(S[k], "AC") == 0){

    		AC++;

		} else if(strcmp(S[k], "WA") == 0){

			WA++;

		} else if(strcmp(S[k], "TLE") == 0){

			TLE++;

		} else if(strcmp(S[k], "RE") == 0){

			RE++;

		}

	}

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

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

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

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

    

    

    return 0;

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

#include <algorithm>

#include <cstring>

#include <string>

#include <cmath>

#include <set>

#include <unordered_set>

#include <vector>

#include<valarray>

#include<map>

#include <bits/stdc++.h>

#include <utility>

#include<bits/stdc++.h>

int a[4];

using namespace std;



int main()

{

int t;

cin>>t;

string s;

while (t--)

{

    cin>>s;

    if(s=="AC")

    {

        a[0]++;

    }

    if(s=="WA")

    {

        a[1]++;

    }

    if(s=="TLE")

    {

        a[2]++;

    }

    if(s=="RE")

    {

        a[3]++;

    }



}

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

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

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

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





    return 0;

}

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

 

int main() {

 

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

    char str[105];

 

    scanf("%d", &N);

    while(N--) {

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



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

	{

		string s; cin>>s;

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

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

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

		else wa++;



	}

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

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

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

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









}

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

 

int main() {

 

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

    char str[105];

 

    scanf("%d", &N);

    while(N--) {

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

#include <algorithm>

#include <cstdlib>

using namespace std;



int main() {

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

    scanf("%d",&x);

    string s;

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

        cin>>s;

        if(s=="AC")

            a++;

        else if (s=="WA")

        b++;

        else if(s=="TLE")

            c++;

        else if(s=="RE")

            d++;

    }

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



}

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

 

int main() {

 

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

    char str[105];

 

    scanf("%d", &N);

    while(N--) {

        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;

}