## USACO 2015 December Contest, Silver

## Problem 2. High Card Wins

Contest has ended.

**Log in to allow submissions in analysis mode**

Bessie and her friend Elsie are currently playing a simple card game where they take a deck of $2N$ cards, conveniently numbered $1 \ldots 2N$, and divide them into $N$ cards for Bessie and $N$ cards for Elsie. The two then play $N$ rounds, where in each round Bessie and Elsie both play a single card, and the player with the highest card earns a point.

Given that Bessie can predict the order in which Elsie will play her cards, please determine the maximum number of points Bessie can win.

#### INPUT FORMAT (file highcard.in):

The first line of input contains the value of N ($1 \leq N \leq 50,000$).The next N lines contain the cards that Elsie will play in each of the successive rounds of the game. Note that it is easy to determine Bessie's cards from this information.

#### OUTPUT FORMAT (file highcard.out):

Output a single line giving the maximum number of points Bessie can score.#### SAMPLE INPUT:

3 1 6 4

#### SAMPLE OUTPUT:

2

Here, Bessie must have cards 2, 3, and 5 in her hand, and she can use these to win at most 2 points by saving the 5 until the end to beat Elsie's 4.

Problem credits: Austin Bannister and Brian Dean