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

#include <bits/stdc++.h>

using namespace std;



// Common file

#include <ext/pb_ds/assoc_container.hpp>

// Including tree_order_statistics_node_update

#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>







#define pb push_back

#define F first

#define S second

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



using ll = long long;

using ld = long double;

using ul = unsigned long long;

using ii = pair<int, int>;

#define Mosta     ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define ReadFile            freopen("input.in","r",stdin)

#define WriteFile           freopen("output.txt","w",stdout)

const ll mod7 = 1000000007,mod = 1000000000,OO = 0x3f3f3f3f;

const ld EPS = 1e-7;

double Pi=acos(-1);

const ld rad=Pi/180.0;

ll power(ll x, ll y, ll p)

{

    ll res = 1;

    while (y > 0)

    {

        if (y & 1)

            res = (res*x) % p;

            y = y>>1;

            x = (x*x) % p;

    }

    return res;

}

ll nCr (ll n,ll m)

{

    return(m == 0)?1:n*nCr(n-1,m-1)/m;

}



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



int main()

{

    int n;

    cin >> n;



    string s1 = "AC" , s2 = "WA" , s3 = "TLE" , s4 = "RE" , ss;

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



    while(n--) {

        cin >> ss;



        if(ss == s1)

            c0++;

        else if(ss == s2)

            c1++;

        else if(ss == s3)

            c2++;

        else

            c3++;

    }



    cout << s1 << " x " << c0 << "\n";

    cout << s2 << " x " << c1 << "\n";

    cout << s3 << " x " << c2 << "\n";

    cout << s4 << " x " << c3 << "\n";



    return 0;

}


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

#include<string.h>

int main (){

	int n;

	int AC=0;

	int WA =0;

	int TLE=0;

	int RE=0;

	char kata[100];

	

	scanf("%d", &n);

while(n--){



        scanf("%s", &kata);

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

            AC++;

        }else if(kata[0]=='W'){

            WA++;

        }else if(kata[0]=='T'){

            TLE++;

        }else if(kata[0]=='R'){

            RE++;

        }

    }	

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

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

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

//		

//		if(kata[i]=='A'&&kata[i+1]=='C'){

//			AC++;

//			continue;

//		}else if(kata[i]=='W'&&kata[i+1]=='A'){

//			WA++;

//			continue;

//		}else if(kata[i]=='T'&&kata[i+1]=='L'&&kata[i+2]=='E'){

//			TLE++;

//			continue;

//		}else if(kata[i]=='R'&&kata[i+1]=='E'){

//			RE++;

//			continue;

//		}	

// }

//	}

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

using namespace std;



int main(){ int n, ac = 0, wa = 0, tle = 0, re = 0;

    cin >> n;

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

        cin >> code;

        if(code == "AC")

            ac++;

        else if(code == "WA")

            wa++;

        else if(code == "TLE")

            tle++;

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

#include<string.h>

int main (){

	int n;

	int AC=0;

	int WA =0;

	int TLE=0;

	int RE=0;

	char kata[100];

	

	scanf("%d", &n);

while(n--){



        scanf("%s", &kata);

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

            AC++;

        }else if(kata[0]=='W'){

            WA++;

        }else if(kata[0]=='T'){

            TLE++;

        }else if(kata[0]=='R'){

            RE++;

        }

    }	

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

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

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

//		

//		if(kata[i]=='A'&&kata[i+1]=='C'){

//			AC++;

//			continue;

//		}else if(kata[i]=='W'&&kata[i+1]=='A'){

//			WA++;

//			continue;

//		}else if(kata[i]=='T'&&kata[i+1]=='L'&&kata[i+2]=='E'){

//			TLE++;

//			continue;

//		}else if(kata[i]=='R'&&kata[i+1]=='E'){

//			RE++;

//			continue;

//		}	

// }

//	}

	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() {

	map <string, int> m;

	long long n;

	string s;

	cin >> n;

	while(n--){

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

#include<string.h>

int main (){

	int n;

	int AC=0;

	int WA =0;

	int TLE=0;

	int RE=0;

	char kata[100];

	

	scanf("%d", &n);

while(n--){



        scanf("%s", &kata);

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

            AC++;

        }else if(kata[0]=='W'){

            WA++;

        }else if(kata[0]=='T'){

            TLE++;

        }else if(kata[0]=='R'){

            RE++;

        }

    }	

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

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

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

//		

//		if(kata[i]=='A'&&kata[i+1]=='C'){

//			AC++;

//			continue;

//		}else if(kata[i]=='W'&&kata[i+1]=='A'){

//			WA++;

//			continue;

//		}else if(kata[i]=='T'&&kata[i+1]=='L'&&kata[i+2]=='E'){

//			TLE++;

//			continue;

//		}else if(kata[i]=='R'&&kata[i+1]=='E'){

//			RE++;

//			continue;

//		}	

// }

//	}

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

using namespace std;



int main(){

int n;

string s1="AC",s2="WA",s3="TLE",s4="RE",m;

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

cin>>n;

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

    cin>>m;

    if(m==s1)c1++;

    else if(m==s2)c2++;

    else if(m==s3)c3++;

    else if(m==s4)c4++;



}

cout<<s1<<" x "<<c1<<endl<<s2<<" x "<<c2<<endl<<s3<<" x "<<c3<<endl<<s4<<" x "<<c4;



    return 0;

}




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

#include<string.h>

int main (){

	int n;

	int AC=0;

	int WA =0;

	int TLE=0;

	int RE=0;

	char kata[100];

	

	scanf("%d", &n);

while(n--){



        scanf("%s", &kata);

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

            AC++;

        }else if(kata[0]=='W'){

            WA++;

        }else if(kata[0]=='T'){

            TLE++;

        }else if(kata[0]=='R'){

            RE++;

        }

    }	

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

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

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

//		

//		if(kata[i]=='A'&&kata[i+1]=='C'){

//			AC++;

//			continue;

//		}else if(kata[i]=='W'&&kata[i+1]=='A'){

//			WA++;

//			continue;

//		}else if(kata[i]=='T'&&kata[i+1]=='L'&&kata[i+2]=='E'){

//			TLE++;

//			continue;

//		}else if(kata[i]=='R'&&kata[i+1]=='E'){

//			RE++;

//			continue;

//		}	

// }

//	}

	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,int> mp;

int main()

{

    int n;

    string s;

    cin>>n;

    while(n--)

    {

        cin>>s;

        mp[s]++;

    }

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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

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

#include <cstdio>

#include <iostream>

#include <algorithm>

using namespace std;



map <string, int> m;

int main() {

	int n;

	cin >> n;

	string s;

	for (int i = 1; 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;

	return 0;

}

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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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



int main()

{

    int n;

    cin>>n;

    map<string, int> mp;

    string s;

    while(n--)

    {

        cin>>s;

        mp[s]++;

    }

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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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;

const int Size = 105;

int Arr1 [Size],Arr2[Size];

int main()

{

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

    cin >> N;

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

        string S;

        cin >> S;

        if (S == "AC") c1++;

        else if (S=="WA") c2++;

        else if (S=="TLE") c3++;

        else c4++;

    }

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

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

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

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

}


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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

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

#include<iostream>

#include<set>

#include<string>

using namespace std;

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

string x;

int main()

{

	cin >> n;

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

	{

		cin >> x;

		if (x == "AC")

			a++;

		else if (x == "WA")

			b++;

		else if (x == "TLE")

			c++;

		else if (x == "RE")

			d++;



	}

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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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;

#include <string>

int main() {

    int s;

    cin>>s;

    string a[s];

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

        cin>>a[i];

    }int z=0,x=0,n=0,m=0;

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

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

            z++;

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

            x++;

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

            n++;

        else 

            m++;

    }

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

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

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

    cout<<"RE x "<<n;



}

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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

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

#include <vector>



using namespace std;



int main() {





	int n; cin>>n;

	string arr[n];

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

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

	{

		cin>>arr[i];

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

			AC++;

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

			WA++;

		else if(arr[i]=="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.251041138369246x):
#include <stdio.h>



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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 pi 3.14159

using namespace std;

typedef long long LL;

const LL MOD = 1e9 + 7;

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

#define AC ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin.sync_with_stdio(0);

int main()

{

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

scanf("%d",&n);

while(n--){

    string s;

    cin>>s;

    if(s=="AC"){

        ac++;

    }

    else if(s=="WA"){

        wa++;

    }

    else if(s=="TLE"){

        tle++;

    }

    else if(s=="RE"){

        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;

}


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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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 ac = 0;

	int wa = 0;

	int tle = 0;

	int re = 0;

	int num = 0;

	string value;

	cin >> num;

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

		cin >> value;

		if (value == "AC") {

			ac++;

		}

		else if (value == "TLE") {

			tle++;

		}

		else if (value == "WA") {

			wa++;

		}

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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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 c[n];

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

        cin >> c[i];

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

            ac++;

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

            wa++;

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

            tle++;

        else

            re++;

    }

    cout<<"AC x "<<ac<<"\n"<<"WA x "<<wa<<"\n"<<"TLE x "<<tle<<"\n"<<"RE x "<<re<<"\n";

    return 0;

}


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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

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

#include<algorithm>

using namespace std;

int main()

{

    vector <string> dash={"AC", "WA", "TLE" , "RE" };

    ios_base::sync_with_stdio(0);

    int n,m;

    cin>>n;

    vector <string> v1(n);

    for(int i=0;i<n;i++)cin>>v1[i];

    for(int i=0;i<4;i++)cout<<dash[i]<<" x "<<count(v1.begin(),v1.end(),dash[i])<<endl;

    return 0;

}

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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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 ;

#include<string>

int main()

{

	int n,a=0,w=0,t=0,r=0;

	cin>>n;

	string c;

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

{

	cin>>c;

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

		a++;

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

		w++;

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

		t++;

	else

		r++;

}

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

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

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

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

}


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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

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

#include <vector>

using namespace std;



int main()

{

    int t, ac = 0, wa = 0, tl = 0, re = 0;

    string s;

    cin >> t;

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

    {



        cin >> s;

        if (s == "AC")

            ac++;

        else if (s == "WA")

            wa++;

        else if (s == "TLE")

            tl++;

        else

            re++;

    }

    cout << "AC x " << ac << "\n" << "WA x " << wa << "\n" << "TLE x " << tl << "\n" << "RE x " << re;

    return 0;

}


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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

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

#include <set>

#include <algorithm>

#include <math.h>

#include <vector>

#include <iterator>

#include<deque>

#include<cstdio>



#define lp(i,a,n) for(int i=a;i<n;++i)

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

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

#define clr(n,a) memset(n,a,sizeof(n))

#define vi vector <int>

#define sc set <char>

#define si set<int>

#define pb push_back

#define vb vector <bool>

#define pi(n) printf("%d\n",n)

#define ln "\n"

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

typedef long long ll;

typedef unsigned long long ull;

using namespace std;





int main()

{

    mahmoud_abdelsamie

    int a[4]={};

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

    int n;cin>>n;

    lp(i,0,n){

        string st; cin>>st;

        if(st==s[0])

            ++a[0];

        else if(st==s[1])

            ++a[1];

        else if(st==s[2])

            ++a[2];

        else

            ++a[3];

    }

    lp(i,0,4){

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

    }

    return 0;

}


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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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:
//:::: Alien :::://

// Muhammad Eid //

#include <bits/stdc++.h>

using namespace std;



#define ll long long

#define ull unsigned long long

#define prINT pair<int, int>



const int N = 4 +5;

int ar[N];



void Mo35(){ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);}



int main(){

Mo35();



    string s;

    int t; cin>> t;

    while(t--){

        cin>> s;

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

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

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

        else ar[3]++;

    }

    cout<< "AC x "<< ar[0]<< "\n";

    cout<< "WA x "<< ar[1]<< "\n";

    cout<< "TLE x "<< ar[2]<< "\n";

    cout<< "RE x "<< ar[3]<< "\n";



return 0;

}


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



int main(){

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

char stat[100];

scanf("%d", &n);

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

    scanf("%s", stat);

    if(stat[1]=='C')

        ac++;

    else if(stat[1]=='A')

        wa++;

    else if(stat[1]=='L')

        tle++;

    else if(stat[1]=='E')

        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;

}