Squares#145

Squares

2 seconds
128 megabytes
Very easy

Given the lengths of segments, determine the maximum number of squares that can be formed from them. Each side of a square must be formed by exactly one segment, and each segment can be used for at most one square side. Only four segments of equal length can be used together to form a square.

Input

The first line contains one integer (1 \leq n \leq 10^6) — the number of segments. The second line contains positive integers, each not exceeding , representing the lengths of the segments.

Output

Print one integer — the maximum number of squares that can be formed from the given segments.

Examples

Example 1

Loading
Loading