#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
struct Data {
	char key;
	int value;
 
	Data(char key, int value)
	{
		this->key = key;
		this->value = value;
	}
};
 
inline bool is_greater(const Data& lhs, const Data& rhs) {
  return lhs.value > rhs.value;
}
 
void print(const vector<Data>& datas)
{
	for (auto& data : datas)
	{
		printf("%c %d\n", data.key, data.value); 
	}
}
 
int main() {
	// your code goes here
 
	vector<Data> datas;
 
	for (char ch = 'A'; ch <= 'Z'; ch++)
	{
		datas.push_back(Data(ch, 1));
 
	}
 
	std::sort(datas.begin(), datas.end(), is_greater);
 
	print(datas);
 
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKc3RydWN0IERhdGEgewoJY2hhciBrZXk7CglpbnQgdmFsdWU7CgoJRGF0YShjaGFyIGtleSwgaW50IHZhbHVlKQoJewoJCXRoaXMtPmtleSA9IGtleTsKCQl0aGlzLT52YWx1ZSA9IHZhbHVlOwoJfQp9OwoKaW5saW5lIGJvb2wgaXNfZ3JlYXRlcihjb25zdCBEYXRhJiBsaHMsIGNvbnN0IERhdGEmIHJocykgewogIHJldHVybiBsaHMudmFsdWUgPiByaHMudmFsdWU7Cn0KCnZvaWQgcHJpbnQoY29uc3QgdmVjdG9yPERhdGE+JiBkYXRhcykKewoJZm9yIChhdXRvJiBkYXRhIDogZGF0YXMpCgl7CgkJcHJpbnRmKCIlYyAlZFxuIiwgZGF0YS5rZXksIGRhdGEudmFsdWUpOyAKCX0KfQoKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCgkKCXZlY3RvcjxEYXRhPiBkYXRhczsKCglmb3IgKGNoYXIgY2ggPSAnQSc7IGNoIDw9ICdaJzsgY2grKykKCXsKCQlkYXRhcy5wdXNoX2JhY2soRGF0YShjaCwgMSkpOwoJCQoJfQoJCglzdGQ6OnNvcnQoZGF0YXMuYmVnaW4oKSwgZGF0YXMuZW5kKCksIGlzX2dyZWF0ZXIpOwoJCglwcmludChkYXRhcyk7CgkKCXJldHVybiAwOwp9