#include <algorithm>
#include <fstream>
#include <iostream>
#include <iterator>
#include <ostream>
#include <string>
#include <vector>
#include <cassert>
#include <map>
#include <iterator>
#include <ios>
#include <iomanip>
map<string, int> counts;
string word;while (cin>>word)
{
++counts[word];
}
string::size_type longest(0);
for (map<string, int>::iterator iter(counts.begin()); iter != counts.end();++iter)
{
if (iter->first.size() > longest)
longest = iter->first.size();
}
const int count_size(10);
for (map<string, int>::iterator iter(counts.begin()); iter != counts.end();++iter)
{
cout << setw(longest)<<left<<iter->first << endl;
cout <<setw(counts.size())<<right<<iter->second << endl;
}
//可以用于统计单词长度 和 数量等(仅作为参考,具体应用需要修改)