Easy game (2)

Consider the following game: Given a sequence of words, count the number of appearances of each one. At the end, print the word that has appeared less times, and the word has appeared more times.

Input

Input is a non empty sequence of words.

Output

Print the word that has appeared less times, and the word that has appeared more times, together with their counters. If there is a tie, choose the lexicographically smallest word.

Problem information

Author: Unknown
Translator: Carlos Molina

Generation: 2026-01-25T12:05:33.288Z