C$++$

A$.$ Splitting in Teams

time limit per test: $1$ second

memory limit per test: $256$ megabytes

input: standard input

output: standard output

There were $n$ groups of students which came to write a training contest. A group is either one person who can write the contest with

anyone else, or two people who want to write the contest in the same team.

The coach decided to form teams of exactly three people for this training. Determine the maximum number of teams of three people he

can form. It is possible that he can't use all groups to form teams. For groups of two, either both students should write the contest, or

both should not. If two students from a group of two will write the contest, they should be in the same team.

Input

The first line contains single integer $n(2n2*{10}^5)-$ the number of groups.

The second line contains a sequence of integers $a_1,a_2,$dots,$a_n(1a_{i}2),$ where $a_i$ is the number of people in group $i.$

Output

Print the maximum number of teams of three people the coach can form.

Examples