import java.util.*;
import java.lang.Exception;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class Pair<F extends Comparable<F>, S extends Comparable<S>> implements Comparable<Pair<F, S>> {
    public final F first;
    public final S second;

    public Pair(F f, S s) { 
        first = f;
        second = s;   
    }
    
    public int compareTo(Pair<F,S> that) {
        int cf = first.compareTo(that.first);
        return cf == 0 ? second.compareTo(that.second) : cf;
    }
}

class count_words {


  public static void main(String args[]) {
    Scanner sc = new Scanner(new InputStreamReader(System.in));
    TreeMap<String,Integer> m = new TreeMap<String,Integer>();
    Locale pl = new Locale("pl","PL");
    Locale.setDefault(pl);
    while(sc.hasNext()) {
      String s = sc.next();
      s = s.toLowerCase(pl).replaceAll("[^\\p{L}]", "");
      if (s.length()<4) continue;
      if (m.containsKey(s)) {
        m.put(s,m.get(s)+1);
      } else {
        m.put(s,1);
      }
    }
    ArrayList<Pair<Integer,String>> tmp = new ArrayList<Pair<Integer,String>>();
    for(String s : m.keySet()) {
        tmp.add(new Pair<Integer,String>(m.get(s),s));
    }
    Collections.sort(tmp);
    Collections.reverse(tmp);
    int i=0;
    for(Pair<Integer,String> p : tmp) {
        i++;
        if (i>20) break;
        System.out.println(""+i+". "+p.second+" (liczba wystapien: "+p.first+")");
        
    }
  }
  
}