Problem:
English Sentence

Your task is to write a program which reads a text and prints two words. The first one is the word which is arise most frequently in the text. The second one is the word which has the maximum number of letters.

The text includes only alphabetical characters and spaces. A word is a sequence of letters which is separated by the spaces.

Input

A text is given in a line. You can assume the following conditions:

The number of letters in the text is less than or equal to 1000.

The number of letters in a word is less than or equal to 32.

There is only one word which is arise most frequently in given text.

There is only one word which has the maximum number of letters in given text.

Output

The two words separated by a space.

Sample Input

Thank you for your mail and your lectures

Output for the Sample Input

your lectures

Solution in JAVA (judge verdict: Accepted)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class Main{
        public static void main(String[] args){
                BufferedReader bfr=new BufferedReader(new InputStreamReader(System.in));
                String str="";
                String[] tango;
                int tangosu=0;
                int max_length=0;
                try{
                        str=bfr.readLine();
                        tango=str.split(" ");
                        tangosu=tango.length;
                        for(int i=0; i<tangosu; i++){
                                if(tango[max_length].length()<tango[i].length()){
                                        max_length=i;
                                }
                        }
                        int[] toujyoukaisu=new int[tangosu];
                        for(int i=0; i<tangosu; i++){
                                toujyoukaisu[i]=0;
                                for(int j=0; j<tangosu; j++){
                                        if(i!=j){
                                                if((tango[i].toLowerCase()).equals((tango[j]).toLowerCase())){
                                                        toujyoukaisu[i]++;
                                                }
                                        }
                                }
                        }
                        int max=0;
                        for(int i=0; i<tangosu; i++){
                                if(toujyoukaisu[max]<toujyoukaisu[i]){
                                        max=i;
                                }
                        }
                        System.out.println(tango[max]+" "+tango[max_length]);
                }catch(IOException e){
                        System.exit(0);
                }
        }
}