This page is still under construction.

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

Tulips

Time limit1sMemory limit128 MB

Summary
Read n beds, collect the distinct catalogue numbers present, and print 15000 minus that count.
Level

Easy1 of 10

Topics
Array, Hash map
Solved
No attempts yet

Problem

There are 15,000 known kinds of tulips in Byteland, and each kind has been assigned a single catalogue number between 1 and 15,000. Byteasar has kept his own private tulip index for many years.

The board of directors of the Botanic Garden believes that gathering every kind of tulip in one place would greatly increase the garden's popularity. They want to know how many kinds of tulips are still missing from the garden.

The kinds of tulips growing in each bed of the garden have already been identified. Determine how many kinds of tulips the board still has to buy in order to have every kind of tulip in the garden.

Input

The first line contains the number of beds in the garden, nn (1≤n≤200001 \le n \le 20000). The second line contains nn integers, each in the range [1,15000][1, 15000], giving the catalogue number of the kind of tulip growing in each bed.

Output

Print a single integer on one line: the number of kinds of tulips the board has to buy in order to have every kind of tulip in the garden.

Examples1

  1. Example 1

    Input
    8
    3 6 2 2 4 6 3 7
    
    Expected output
    14995