# Word Order HackerRank Solution in Python

### Problem

You are given n words. Some words may repeat. For each word, output its number of occurrences. The output order should correspond with the input order of the appearance of the word. See the sample input/output for clarification.

Note: Each input line ends with a "\n" character.

### Constraints:

The sum of the lengths of all the words does not exceed

All the words are composed of lowercase English letters only.

### Input Format

The first line contains the integer, n.

The next n lines each contain a word.

### Output Format

Output 2 lines.

On the first line, output the number of distinct words from the input.

On the second line, output the number of occurrences for each distinct word according to their appearance in the input.

4

bcdef

abcdefg

bcde

bcdef

3

2 1 1

### Explanation

There are 3 distinct words. Here, "bcdef" appears twice in the input at the first and last positions. The other words appear once each. The order of the first appearances is "bcdef", "abcdefg" and "bcde" which corresponds to the output.

### Solution

 ```1 2 3 4 5 6 7 8``` ```# Enter your code here. Read input from STDIN. Print output to STDOUT from collections import Counter, OrderedDict class OrderedCounter(Counter, OrderedDict): pass d = OrderedCounter(input() for _ in range(int(input()))) print(len(d)) print(*d.values()) ```

No Comment