20376번 - Counting Monuments 다국어

Alice loves visiting Paris. Every time she is in the city, she tries to see as many monuments as she can, and every day of her visit she notes down in her travel notebook which monument she saw that day. After many years and many trips to Paris, Alice is wondering how many different monuments she saw in her combined visits. She shows you her travel notebook, and asks for your help in computing this number.

The input consists of n lines, all of which contain, first, a date (in the format YYYY-MM-DD), then a space, then the name of a monument. Names of monuments are character strings of arbitrary length and containing arbitrary printable characters except for the newline character.

The output should consist of a single line, whose content is an integer, the number m of distinct monuments in the input.

• 1 ≤ n ≤ 1 000 000