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

using namespace std;



int main()

{

    int N;

    cin >> N;

    string S[100000];

    int A = 0, W = 0, T = 0, R = 0;

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

        cin >> S[i];

    }

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

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

            A ++;

        }

    }

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

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

            W ++;

        }

    }

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

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

            T ++;

        }

    }

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

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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

#include <set>

#include <string>



using namespace std;



int main() {

    int n; cin >> n;

    string temp;

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

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

        cin >> temp;

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

        else if(temp == "WA") wa++;

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

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

    }

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

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

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

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

}

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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

using namespace std;

int main(){

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

    string s;

    cin>>x;

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

        cin>>s;

        if(s=="AC"){

            c1++;

        }

        else if(s=="WA")

            c2++;

        else if (s=="TLE")

            c3++;

        else if(s=="RE")

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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

using namespace std;

int main()

{

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

	string test;

	cin>>n;

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

	{

		cin>>test;

		if (test=="AC")

			AC++;

		else if (test=="TLE")

			TLE++;

		else if (test=="WA")

			WA++;

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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

typedef long long ll;

#define dbg(x) cout<<#x<<" = "<<x<<endl

#define dbg2(x,y) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<endl

#define dbg3(x,y,z) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<endl

#define dbg4(x,y,z,q) cout<<#x<<" = "<<x<<", "<<#y<<" = "<<y<<", "<<#z<<" = "<<z<<", "<<#q<<" = "<<q<<endl

#define dbg_array(x,sz) for (int i = 0; i < sz; ++i) cout << x[i] << " \n"[i==sz-1]

using namespace std;



const ll N = 100 + 9, M = 400 - 9, Max_ans = 1LL * (1e16);

int vis[N];



int main() {

	ios_base::sync_with_stdio(0), cin.tie(0);

#ifdef ECLIPSE

	freopen("input.in", "rt", stdin);

	//freopen("output.out", "wt", stdout);

#endif

	int n;

	cin >> n;

	string s;

	while (n--) {

		cin >> s;

		++vis[s[0] - 'A'];

	}

	printf("AC x %d\n", vis['A' - 'A']);

	printf("WA x %d\n", vis['W' - 'A']);

	printf("TLE x %d\n", vis['T' - 'A']);

	printf("RE x %d\n", vis['R' - 'A']);

	return 0;

}




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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

#include <map>

#include <string>

using namespace std;



int main()

{

	map<string, int> test;

	int count = 0;

	string verdict;

	cin >> count;

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

	{

		test["AC"] = 0;

		

		test["WA"] = 0;

		

		test["TLE"] = 0;



		test["RE"] = 0;

	}



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

	{

		cin >> verdict;

		

		if (verdict == "AC")

			test["AC"]++;

		else if (verdict == "WA")

			test["WA"]++;

		else if (verdict == "TLE")

			test["TLE"]++;

		else if (verdict == "RE")

			test["RE"]++;

	}

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

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

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

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

	return 0;

}


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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

using namespace std;

#define ll long long



bool cmp(const pair<string, int>&i, const pair<string, int>&j)

{

    return i.second > j.second;

}







int main() {

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

            int n ; cin >> n ;  string s ;

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

                  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;

    

        return 0;

    }

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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

#include<string>

using namespace std;

int main(){

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

	cin>>t;

	string test;

	while(t--){

		cin>>test;

		if(test == "AC")

		   c0++;

		else if(test == "WA")

		   c1++;

		else if(test == "TLE")

		   c2++;

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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

#include <string>



using namespace std;



int main()

{

    int N;

    cin>>N;



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

    string s;



    while(N--)

    {

        cin>>s;



        if(s.compare("AC")==0)

            AC++;



        if(s.compare("WA")==0)

            WA++;



        if(s.compare("TLE")==0)

            TLE++;



        if(s.compare( "RE")==0)

            RE++;





    }



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

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

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

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

}


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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

#include<cstdio>

#include<map>

using namespace std;

int main(void)

{

    ios::sync_with_stdio(false);

    map<string,int> mp;

    int n;

    char ch[10];

    while(cin>>n)

    {

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

        cin>>ch,mp[ch]++;

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

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

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

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

    }

    return 0;

} 

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

int main() {

	int tc;

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

	char ans[5];

	

	int AC_ctr = 0;

	int WA_ctr = 0;

	int TLE_ctr = 0;

	int RE_ctr = 0;

	

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

	{

		scanf("%s\n",&ans);

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

		{

			AC_ctr++;

		} 

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

		{

			WA_ctr++;

		} 

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

		{

			TLE_ctr++;

		} 

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

		{

			RE_ctr++;

		}

	}



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

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

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

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

	return 0;

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

#include<string>

#include<stdio.h>

#include<stdlib.h>

#include<set>

#include<map>

#include<vector>

#include<queue>

using namespace std;

#define mp(a,b) make_pair(a,b)

#define pb push_back



int main(){

    int n;

    cin>>n;

    int a[5];

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

        a[i] = 0;

    }

    string sss;

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

        cin>>sss;

        if (sss == "AC"){

            a[1]++;

        }

        if (sss == "WA"){

            a[2]++;

        }

        if (sss == "TLE"){

            a[3]++;

        }

        if (sss == "RE"){

            a[4]++;

        }

    }

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

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

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

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

}


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

#include <string.h>



int main(){

	long long N;

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

	scanf("%lld", &N);

	char a[N][5];

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

		scanf("%s", &a[i]);

		switch(a[i][0]){

			case 'A':

				AC++;

				break;

			case 'W':

				WA++;

				break;

			case 'T':

				TLE++;

				break;

			case 'R':

				RE++;

				break;

		}

	}

	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 God



#include <bits/stdc++.h>



using namespace std;



int main() {

	ios_base::sync_with_stdio(false);

	cin.tie(0);



	map<string, int> mp;



	int n;

	cin >> n;

	while(n--) {

		string s;

		cin >> s;

		mp[s]++;

	}



	cout << "AC x " << mp["AC"] << "\n";

	cout << "WA x " << mp["WA"] << "\n";

	cout << "TLE x " << mp["TLE"] << "\n";

	cout << "RE x " << mp["RE"] << "\n";



	return 0;

}


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

#include <string.h>



int main(){

	long long N;

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

	scanf("%lld", &N);

	char a[N][5];

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

		scanf("%s", &a[i]);

		switch(a[i][0]){

			case 'A':

				AC++;

				break;

			case 'W':

				WA++;

				break;

			case 'T':

				TLE++;

				break;

			case 'R':

				RE++;

				break;

		}

	}

	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 <ext/pb_ds/assoc_container.hpp>

using namespace __gnu_pbds;

using namespace std;



typedef long long ll;

const int N = 2e5 + 10, OO = 0x3f3f3f3f, mod = 1e9 + 7;



#define PI acos(-1)

#define clr(arr, val) memset(arr, val, sizeof(arr))

#define loop(i, n) for (int i = 0; i < int(n); i++)

#define rloop(i, n) for (int i = int(n) - 1; i >= 0; i--)

#define xloop(i, a, b) for (int i = int(a); i <= int(b); i++)

#define ALL(v) ((v).begin()), ((v).end())

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

//int dx[] = {1, 0, -1, 0};

//int dy[] = {0, 1, 0, -1}; //4 Direction

int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};

int dy[] = {0, 1, 1, 1, 0, -1, -1, -1}; //8 direction

//int dx[]={2,1,-1,-2,-2,-1,1,2};int dy[]={1,2,2,1,-1,-2,-2,-1};//Knight Direction

//int dx[6]={2,1,-1,-2,-1,1};int dy[6]={0,1,1,0,-1,-1}; //Hexagonal Direction



int n;

int main()

{

  //ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);



  cin >> n;

  string s;

  map < string , int > cnt;

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

    cin >> s;

    cnt[s]++;

  }



  cout << "AC x " << cnt["AC"] << "\n";

  cout << "WA x " << cnt["WA"] << "\n";

  cout << "TLE x " << cnt["TLE"] << "\n";

  cout << "RE x " << cnt["RE"] << "\n";





  return 0;

}


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

#include <string.h>



int main(){

	long long N;

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

	scanf("%lld", &N);

	char a[N][5];

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

		scanf("%s", &a[i]);

		switch(a[i][0]){

			case 'A':

				AC++;

				break;

			case 'W':

				WA++;

				break;

			case 'T':

				TLE++;

				break;

			case 'R':

				RE++;

				break;

		}

	}

	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:
#define _CRT_SECURE_NO_WARNINGS

#include <bits/stdc++.h>

#include <unordered_map>

#define endl '\n';

#define all(v) ((v).begin()), ((v).end())

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

#define Ceil(x,y)             ((x+y-1)/y)

#define RT(x)           return cout<<x,0;

#define mem(x,y)    memset(x,y,sizeof(x))

#define vi                    vector<int>

#define pii                 pair<int,int>

#define fx(n)           fixed<<setprecision(n)

#define watch(x) cout<<(#x)<<" = "<<x<<endl

#define forr(i, n) for (int i = 0; i < int(n); i++)

typedef long long ll;

typedef unsigned long long ull;

typedef double dl;

const double PI = acos(-1), EPS = 1e-7;

const int OO = 0x3f3f3f3f, N = 1e7 + 5, MOD = 1e9 + 7;

using namespace std;

void fast() { std::ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); }

int main()

{

	fast();

	int n;

	cin>>n;

	map<string,int>mp;

	string s;

	while(n--)

    {

        cin>>s;

        mp[s]++;

    }

    cout<<"AC x "<<mp["AC"]<<"\n";

    cout<<"WA x "<<mp["WA"]<<"\n";

    cout<<"TLE x "<<mp["TLE"]<<"\n";

    cout<<"RE x "<<mp["RE"]<<"\n";

    return 0;

}


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

#include <string.h>



int main(){

	long long N;

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

	scanf("%lld", &N);

	char a[N][5];

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

		scanf("%s", &a[i]);

		switch(a[i][0]){

			case 'A':

				AC++;

				break;

			case 'W':

				WA++;

				break;

			case 'T':

				TLE++;

				break;

			case 'R':

				RE++;

				break;

		}

	}

	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

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

#include <string.h>



int main(){

	long long N;

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

	scanf("%lld", &N);

	char a[N][5];

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

		scanf("%s", &a[i]);

		switch(a[i][0]){

			case 'A':

				AC++;

				break;

			case 'W':

				WA++;

				break;

			case 'T':

				TLE++;

				break;

			case 'R':

				RE++;

				break;

		}

	}

	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,nAC=0,nWA=0,nTLE=0,nRE=0,i;

    string in;

    cin>>n;

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

    {

        cin>>in;

        if(in=="AC")

            nAC++;

        else if(in=="WA")

            nWA++;

        else if(in=="TLE")

            nTLE++;

        else

            nRE++;

    }

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

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

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

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

    return 0;

}

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

#include <string.h>



int main(){

	long long N;

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

	scanf("%lld", &N);

	char a[N][5];

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

		scanf("%s", &a[i]);

		switch(a[i][0]){

			case 'A':

				AC++;

				break;

			case 'W':

				WA++;

				break;

			case 'T':

				TLE++;

				break;

			case 'R':

				RE++;

				break;

		}

	}

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



/*If you are going to try,keep going until the end ,or don't even try to start*/



/* Remember, Hope is a good thing... May be the best of things... And No Good thing ever Dies !!!*/



using namespace std;



#define ll long long

#define nada "\n"

#define st string

#define S  second

#define F  first

#define pb push_back

#define MP make_pair

#define isnttriangle(a,b,c)  (a+b<c||a+c<b||b+c<a)

#define todegree(rad) rad*(180.0/pi)

#define rrp(i, a, b)  for(ll i = a; i >= b; i--)

#define repp(i,a,b)   for (int i = int(a); i <=int(b); i++)

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

#define rep1(i,n)     for (int i = 1; i <=n; i++)

#define allr(v)       ((v).rbegin()), ((v).rend())

#define all(v)        ((v).begin()),((v).end())

#define fx(n)         cout<<fixed<<setprecision(n);

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

#define Test          ll t;cin>>t;while(t--)

#define mod           1000000009LL





const double ME = 2.71828;

const int    N  = 3e5 + 20;

const int   inf = 0x3f3f3f3f;

const double pi = 3.141592653;









void LOSER()

{

    ios::sync_with_stdio(0);

    cin.tie(0);

    cout.tie(0);

}



void file()

{

    freopen("records.in", "r", stdin);

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

}



ll gcd(ll a, ll b)

{

    //Eculidean Algorthim

    return (!b) ? a : gcd(b, a % b);

    //complixty=log(ab);

}



ll lcm(ll a,ll b)

{

    return a / gcd(a, b) * b;

}



ll Fib_recur(ll n)

{

    vector<ll>v(n+5,0);

    //BaseCase

    v[1]=0;

    v[2]=1;

    repp(i,3,n)v[i]=v[i-1]+v[i-2];

    return v[n];

}



bool isprime(int n)

{

    for(int i = 2; i <= sqrt(n); i++)

    {

        if(n%i == 0)

            return false;

    }

    return true;

}



void Solve()

{



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

  st s;

  cin>>n;

  while(n--)

  {

      cin>>s;

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

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

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

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

  }

  cout<<"AC"<<" x "<<AC<<nada;

  cout<<"WA"<<" x "<<WA<<nada;

  cout<<"TLE"<<" x "<<TLE<<nada;

  cout<<"RE"<<" x "<<RE<<nada;

}











int main()

{

    // fx(7)

    //file();

    LOSER();

    //Test



    Solve();















}

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

#include <string.h>



int main(){

	long long N;

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

	scanf("%lld", &N);

	char a[N][5];

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

		scanf("%s", &a[i]);

		switch(a[i][0]){

			case 'A':

				AC++;

				break;

			case 'W':

				WA++;

				break;

			case 'T':

				TLE++;

				break;

			case 'R':

				RE++;

				break;

		}

	}

	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;

}