// uses https://github.com/martinus/robin-hood-hashing
#include <iostream>
#include <vector>
#include <unordered_map>
#include "robin_hood.h"
#include <algorithm>

using namespace std;

int main() {
  std::ios::sync_with_stdio(false);

  string s;
  robin_hood::unordered_map<string, int> count;
  while (cin >> s)
    count[s]++;

  vector<robin_hood::pair<string,int>> temp(count.begin(), count.end());

  sort(temp.begin(), temp.end(),
       [](auto const& a,auto const& b) { return b.second < a.second; } );

  for (std::size_t i = 0; i < temp.size(); ++i)
    cout << temp[i].second << " " << temp[i].first << "\n";
}