import std.stdio;
import std.string;
import std.conv;
import std.algorithm;

void main(){
  auto N = readln.chomp.to!ulong;
  ulong[][string] history;
  for(ulong i = 1; i <= N; i++){
    string s = readln.chomp;
    history[s] ~= i;
  }
  foreach(k; history.keys.sort){
    ulong result = 0;
    ulong prev = 0;
    ulong sum = 0;
    foreach(d; history[k]){
      result += sum * (d - prev);
      prev = d;
      sum += d;
    }
    result += sum * (N - prev + 1);
    writefln("%d %s", result, k);
  }
}