Different products in the orders

Problem

An online store logs the product id of every item ordered today. Some products were ordered many times. Count how many different products were ordered.

Input, output and limits

Input: The first line has n. The second line has n product ids (words).
Output: One integer: the number of different product ids.
Constraints: 1 ≤ n ≤ 10^5
Each id is a word of up to 12 letters or digits

Examples

Example

Input

6
P10 P22 P10 P31 P22 P10

Output

Three different ids: P10, P22 and P31.

Hints

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

Hint 1

A set keeps each value once, so its size is the answer.

Hint 2

Add every id to a HashSet<String>, then print size().

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

Solve in the editor

Is any order id repeated?easy
Customers A to Z, each onceeasy
Is this coupon valid?easy
When is the catalogue fully ordered?medium
Products sold in both storesmedium

All Java problems

Problem

Input, output and limits

Examples

Hints

More Sets problems

Problem

Input, output and limits

Examples

Hints

More Sets problems