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


#include<iostream>

#include<string.h>

#include<algorithm>



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

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

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

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

	}

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

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

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

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

	return 0;

}

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

	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 <bits/stdc++.h>



using namespace std;



int main()

{

    int N, acCnt = 0, waCnt = 0, tleCnt = 0, reCnt = 0;

    cin >> N;

    string AC = "AC", WA = "WA", TLE = "TLE", RE = "RE", x;

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

    {

        cin >> x;

        if(x == AC)

            acCnt++;

        else if(x == WA)

            waCnt++;

        else if(x == TLE)

            tleCnt++;

        else if(x == RE)

            reCnt++;

    }

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

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

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

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

    return 0;

}


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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

	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 <bits/stdc++.h>

using namespace std;

struct test {

string T;

int n;



};

int main(){

    test test_cases[4];

    test_cases[0].T = "AC", test_cases[1].T = "WA", test_cases[2].T = "TLE", test_cases[3].T = "RE" ;

    test_cases[0].n = 0, test_cases[1].n = 0, test_cases[2].n = 0, test_cases[3].n = 0;

    int m;

    cin>>m;

    string s;

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

        cin>>s;

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

            if(s == test_cases[j].T){

                test_cases[j].n++;

            }

        }

    }

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

        cout<<test_cases[i].T<<" x "<<test_cases[i].n<<endl;

    }

    return 0;

}




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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

	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 N,C0=0,C1=0,C2=0,C3=0;

cin>>N;

string s[N];



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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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

#include <cstdlib>

#include<cmath>

#include<string>

#include <iomanip>

#include <sstream>



using namespace std;







int main (){



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

    int a[4]={0,0,0,0};







    int n,i,j,cnt=0;

    cin>>n;



    string words[n];



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



        cin>>words[i];



    }



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



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



            if( s[i] == words[j] ){



                cnt++;

            }



        }



        a[i]=cnt;

        cnt=0;



    }





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



    cout<<s[i]<<" "<<"x"<<" "<<a[i];

    cout<<endl;



}













}

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

	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 x,a=0,w=0,t=0,r=0;

cin>>x;

string arr[x];

for(int i=0;i<x;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.255273484872643x):
#include <stdio.h>



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

	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 <bits/stdc++.h>

using namespace std;

typedef long long int ll;

const int N=3e5+9;





int main()

{



    ios_base::sync_with_stdio(0);

    cin.tie(0);

    int n;

    string s;

    map<string,int>cnt;

    cin>>n;

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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

#include <map>



using namespace std;



map<string, int>mymap;

int main() {

	int N;

	cin >> N;

	mymap["AC"] = 0;

	mymap["WA"] = 0;

	mymap["TLE"] = 0;

	mymap["RE"] = 0;

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

		string s;

		cin >> s;

		mymap[s]++;

	}

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

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

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

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

	return 0;

}

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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

    string value;

    int c[4] = {0,0,0,0};

    cin>> n;

    while(n){

        cin>> value;

        if(value == "AC")

            c[0]+= 1;

        else if(value == "WA")

            c[1]+= 1;

        else if(value == "TLE")

            c[2]+= 1;

        else

            c[3]+= 1;

        n--;

    }

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

    return 0;

}


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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

	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 <bits/stdc++.h>

#include<sstream>

using namespace std;

const int N = 1e5 + 7, M = 1e7, OO = 0x3f3f3f3f;

#define endl '\n'

#define  ll long long

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

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

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

#define p(a) printf("%d ",a)

#define S(n) scanf("%d",&n)

int main () {

    map<string,int>mp;

    mp["AC"]=0;

    mp["WA"]=0;

    mp["TLE"]=0;

    mp["RE"]=0;

    int n;S(n);

    string s;

    loop(i,n) {

        cin >> s;

        mp[s]++;

    }

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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

#include<map>

#include<set>

#include<string>

#include<algorithm>

#include<math.h>

#include<bits/stdc++.h>

#include<cmath>

#include<iomanip>

using namespace std;



const double PI  =3.141592653589793238463;

#define pb push_back

#define pf push_front

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

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

typedef unsigned long long ull;

typedef long long ll;



typedef vector<int> vi;

typedef pair<int,int> pi;

//2 7 3 4 9



void printVec(vi v1)

{

    for(int i=0; i<v1.size(); i++)

        cout<<v1[i]<<" ";

    cout<<endl;

}

int main()

{

    ios::sync_with_stdio(false);

    cout.tie(NULL);

    cin.tie(NULL);





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



long long t;cin>>t;

string s;

while(t--){

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

	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<bits/stdc++.h>

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

#define ll long long

#define ull unsigned long long

#define ii pair<int,int>

#define dl endl

#define ft first

#define sc second

using namespace std;

int n, a[4];

string s;

int main()

{

	//freopen("", "r", stdin);

	//freopen("", "w", stdout);

	input;

	cin >> n;

	while (n--)

	{

		cin >> s;

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

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

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

		else a[3]++;

	}

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

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

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

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

}

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

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



int main (){

	

	int n;

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

	scanf("%d", &n);

	

	char str[105];

	

	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;

}