### Problem Statement

You are working in an advertising agency. There are 100 billboards owned by your agency, numbered from 1 to 100.

You clients send you requests, one after another. Each request is the number of the billboard on which the client would like to place his advertisement.

Initially all billboards are empty. Each time you receive a request, you act as follows. If the corresponding billboard is empty, you satisfy the request and occupy the billboard with the client's advertisement. If the corresponding billboard is occupied, you reject the request.

You are given a int[] requests containing the requests in the order you receive them. Return the number of rejected requests.

### Definition

 Class: AdvertisingAgency Method: numberOfRejections Parameters: int[] Returns: int Method signature: int numberOfRejections(int[] requests) (be sure your method is public)

### Constraints

-requests will contain between 1 and 50 elements, inclusive.
-Each element of requests will be between 1 and 100, inclusive.

### Examples

0)

 `{1,2,3}`
`Returns: 0`
 All requests will be satisfied.
1)

 `{1,1,1}`
`Returns: 2`
 Only the first request will be satisfied.
2)

 `{1,2,1,2}`
`Returns: 2`
3)

 ```{100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100 }```
`Returns: 49`

#### Problem url:

http://www.topcoder.com/stat?c=problem_statement&pm=7558

#### Problem stats url:

http://www.topcoder.com/tc?module=ProblemDetail&rd=10721&pm=7558

andrewzta

#### Testers:

PabloGilberto , brett1479 , Olexiy

#### Problem categories:

Simple Search, Iteration