Challenges

Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 2060
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 2856
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 1422
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 2283
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 3301
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2289
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 1662
Degree Celsius
Tom is a scientist. He uses huge machines for complex calculations. Th...
Max. Marks: 4
Solved By : 3817
Three's Company
This problem requires you to create a output string from input string ...
Max. Marks: 4
Solved By : 2605
Array Sum
You are given an integer array and you have to find the sum of the ele...
Max. Marks: 4
Solved By : 2587
Word Frequency
Please select a challenge
Problem Statement
You will be given a group of words. You need to print all unique words in that group in descending order of their frequency, i.e the word repeated most number of times will come first. In case of two words having the same frequency, the word listed earlier in the group will be printed first.

Input
First line contains N, the number of words. Next line contains N space-separated words.

Output
Print the words in descending order of their frequency

Constraints
1 ≤ N ≤ 20 1 ≤ word[i].length ≤ 40

Sample Input
12
can you can a can as a canner can can a can

Sample Output

can a you as canner

Dcoded By: Mrudul Sankhere

Solved By: 446

Maximum Marks: 10