This page is still under construction.

Parts of this page are still being built. What you see may change.

Kinder Surprise

Interview

Time limit1sMemory limit64 MB

Summary
Given n hippo statuette names with some repeats, output how many of the n statuettes are still missing, which is n minus the number of distinct names.
Level

Easy2 of 10

Topics
Hash map, String
Solved
No attempts yet

Problem

"Kinder Surprise" is a chocolate egg with a toy or a souvenir inside. You never know what is inside this time!

Recently little Pasha discovered that each egg from the new series of "Kinder Surprise" contains a hippo statuette. There are nn hippo statuettes in total, and Pasha wants to collect them all.

Without thinking twice, Pasha bought nn "Kinder Surprise" eggs from the new series. Then he was completely disappointed by something he did not expect: some of the hippo statuettes were identical. That was the real surprise!

After his grief, Pasha decided to find how many hippo statuettes he has yet to collect. Help him solve this problem.

Input

The first line contains an integer nn (2≤n≤1002 \le n \le 100).

The following nn lines describe the hippo statuettes, one per line. The description of the ii-th statuette is a string of length between 1 and 20 that contains small Latin letters and underscores (_). Two statuettes are identical if and only if their descriptions are equal.

It is guaranteed that at least two statuettes are identical.

Output

Output one integer: the number of hippo statuettes that Pasha has yet to collect.

Examples1

  1. Example 1

    Input
    10
hippo_in_tank
lazy_hippo
hippo_vampire
bizarre_hippo
hippo_in_tank
hippo_ninja
hippie_hippo
lazy_hippo
hippo_in_tank
hip_hop_hippo
    Expected output
    3