#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
using namespace std;
 
unordered_map <string, unsigned> uniqueWords;
 
bool compare(string a, string b) {
	return uniqueWords[a] > uniqueWords[b];
}
 
int main() {
	vector<string> words;
	for (string s; cin >> s;) {
		words.push_back(s);
		++uniqueWords[s];
	}
	sort(words.begin(), words.end(), compare);
	for (auto c : words) {
		if (uniqueWords[c]) {
			cout << c << ' ';
			uniqueWords[c] = 0;
		}
	}
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8dW5vcmRlcmVkX21hcD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnVub3JkZXJlZF9tYXAgPHN0cmluZywgdW5zaWduZWQ+IHVuaXF1ZVdvcmRzOwoKYm9vbCBjb21wYXJlKHN0cmluZyBhLCBzdHJpbmcgYikgewoJcmV0dXJuIHVuaXF1ZVdvcmRzW2FdID4gdW5pcXVlV29yZHNbYl07Cn0KCmludCBtYWluKCkgewoJdmVjdG9yPHN0cmluZz4gd29yZHM7Cglmb3IgKHN0cmluZyBzOyBjaW4gPj4gczspIHsKCQl3b3Jkcy5wdXNoX2JhY2socyk7CgkJKyt1bmlxdWVXb3Jkc1tzXTsKCX0KCXNvcnQod29yZHMuYmVnaW4oKSwgd29yZHMuZW5kKCksIGNvbXBhcmUpOwoJZm9yIChhdXRvIGMgOiB3b3JkcykgewoJCWlmICh1bmlxdWVXb3Jkc1tjXSkgewoJCQljb3V0IDw8IGMgPDwgJyAnOwoJCQl1bmlxdWVXb3Jkc1tjXSA9IDA7CgkJfQoJfQp9

QSBCIEhFTExPIEhFTExP

A B HELLO HELLO