QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 32 MB Total points: 10

#10377. Tulips

Statistics

15 thousand kinds of tulips are known in Byteland (approximately the same number of cultivars of tulips is known in the "real" world). For many years Byteasar has been maintaining his private tulip index in which each kind of these magnificent flowers has received a catalogue number between 1 and 15 000.

Recently the board of directors of the Bytean Botanic Garden has made an interest in Byteasar's index. In the garden grow lots of different kinds of tulips. The board of directors figured out that if they are able to collect all different kinds of tulips, this would significantly increase the popularity of the garden. They asked Byteasar to find out how many kinds of tulips are still missing in the garden.

Byteasar has already managed to identify the kinds of tulips that grow in the respective beds of the garden. Unfortunately, it is hard for him to count the number of kinds of tulips that are still missing. Could you help him with that?

Input Format

The first line of the standard input contains one integer $ n $ ($1 \le n \le 20\,000$) that denotes the number of beds of tulips in the garden. The second line contains $ n $ integers from the interval $[1,15\,000]$ that denote the catalogue numbers of kinds of tulips that grow in the respective beds in the garden.

Output Format

Your program should write to the standard output one line with a single integer: the number of kinds of tulips that the board of directors has to buy to have all the kinds of tulips in the garden.

Example

Input

8
3 6 2 2 4 6 3 7

Output

14995
About Issues

We understand that our problem archive is not perfect. If you find any issues with the problem, including the statement, scoring configuration, time/memory limits, test cases, etc.

You may use this form to submit an issue regarding the problem. A problem moderator will review your issue and proceed it properly.

STOP! Before you submit an issue, please READ the following guidelines:

  1. This is not a place to publish a discussion, editorial, or requests to debug your code. Your issue will only be visible by you and problem moderators. Other users will not be able to view or reply your issues.
  2. Do not submit duplicated issues. If you have already submitted one, please wait for an moderator to review it. Submitting multiple issues will not speed up the review process and might cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
  4. Be sure your issue is related to this problem. If you need to submit an issue regarding another problem, contest, category, etc., you should submit it to the corresponding page.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.