Maximum Unique Teams

You are given n players along with their rating scores. Your task is to form as many unique teams as possible where each team consists of exactly two players. Each player can be a member of at most one team. The answer is given by \( \lfloor \frac{n}{2} \rfloor \), since forming each team consumes two players.

Note that although the ratings are provided, they do not affect the maximum number of teams. Read the input from standard input and output the result to standard output.

inputFormat

The first line contains an integer n (\(0 \le n \le 10^6\)), representing the number of players.
The second line contains n space-separated integers, which represent the rating scores of the players.

outputFormat

Output a single integer representing the maximum number of teams that can be formed.

6
8 2 5 1 9 4

3