First sign-up only

Problem

A customer may sign up for a sale more than once. Keep only the first sign-up of each customer, in the original order, and count how many repeats were dropped.

Input, output and limits

Input: The first line has n. The second line has n customer names (one word each).
Output: Unique: <count>, then the unique names on one line separated by spaces, then Dropped: <count>.
Constraints: 1 ≤ n ≤ 1000

Examples

Example

Input

5
Asha Ravi Asha Meena Ravi

Output

Unique: 3
Asha Ravi Meena
Dropped: 2

Hints

Try the problem first. Open one hint at a time.

Hint 1

Build a second list of the names seen so far.

Hint 2

Add a name only when unique.contains(name) is false.

Write your Java code, run it on the examples and submit it to hidden tests.

Solve in the editor

Out-of-stock clean-upmedium
Merge two price listsmedium
Newest order firsteasy
Rotate the delivery queuemedium
Dearest and cheapesteasy

All Java problems

Problem

Input, output and limits

Examples

Hints

More Lists problems

Problem

Input, output and limits

Examples

Hints

More Lists problems