IITKWPCO - Create Collections


  Little Feluda likes to play very much. As you know he only plays with numbers. So he is given n numbers. Now tries to group the numbers into disjoint collections each containing two numbers. He can form the collection containing two numbers iff small number in the collection is exactly half of large number.

  Given n numbers, Find out how many maximum number of collections he can form ?

Input

T: number of test cases. (1 <= T <= 100).

For each test case:

First line will contain n :  (1 <= n <= 100)

Then next line will contain n numbers single space seperated. Range of each number will be between 1 and 10^6.

Output

For each test case, output maximum number of collections that can be formed.

Example

Input:
2
2
1 2
3
1 2 4
Output:
1
1

hide comments
vineetpratik: 2016-07-04 12:25:03

just take care of repetition, easy using map :)

pvsmpraveen: 2016-06-27 14:16:48

Never forget to .clear() something after each test case ;)

mkfeuhrer: 2016-06-21 23:03:55

simple hashing !! AC in 1 go :-) take 10^7 size and use scanf...!

gkr007: 2016-06-02 16:30:05

@kp ur test case really helped ;)

atulsinha007: 2016-01-31 07:40:11

nice and easy one.. though 2 WA's :(

rajat: 2015-08-20 20:48:28

easy one
ac in first attempt

goyal: 2015-07-19 12:39:05

AC:) using maps

ashish22_dwd: 2015-07-07 19:54:48

why i m getting WA.. plz check my code http://ideone.com/ZMNkvk

kp: 2015-07-06 09:09:42

good one, try
1
4
8 4 16 2
o/p: 2

Akshit Johry: 2015-06-04 21:19:06

AC solution...
1
4
1 2 2 1
o/p
2
something wrong o.O


Added by:praveen123
Date:2013-08-12
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:IITK ACA CSE online judge