Nicholas, a painter is going to paint several new canvases.尼古拉斯确信这些画布会变得如此出色,以至于每幅画布都需要装框并挂在墙上。尼古拉斯决定从框架开始。
Nicholas has n sticks whose lengths equal a1, a2, ... an.尼古拉斯不想折断木棍或将它们粘在一起。为了制作一个 h × w 大小的框架,他需要两根长度等于 h 的木棍和两根长度等于 w 的木棍。 Specifically, to make a square frame (when h = w), he needs four sticks of the same length.
现在尼古拉斯想要用他拥有尽可能多的框架的木棍制作; to be able to paint as many canvases as possible to fill the frames.帮助他完成这项艰巨的任务。 Note that it is not necessary to use all the sticks Nicholas has.
输入
The first line contains an integer n (1 ≤ n ≤ 100) — the number of sticks. The second line contains n space-separated integers. The i-th integer equals the length of the i-th stick ai (1 ≤ ai ≤ 100).
输出
打印单个数字 - 尼古拉斯可以为他未来的画布制作的最大帧数。
示例
输入 #1
5 2 4 3 2 3
输出 #1
1
输入 #2
13 2 2 4 4 4 4 6 6 6 7 7 9 9
输出 #2
3
输入 #3
4 3 3 3 5
输出 #3
0