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
Ayush Nigam:
20140630 21:11:40
o(nlogn) and with much optimisation :D:D 

UnrealNinja:
20140630 21:11:40
Test File is poorly created.


à®•à¯ˆà®ªà¯à®³à¯à®³:
20140630 21:11:40
don't divide. use multiplication cause 2 WA :( 

Bhavik:
20140630 21:11:40
ac in 1st attempt:)


Prakhar Gupta:
20140630 21:11:40
too easy.... :) 

wa:
20140630 21:11:40
@viki


viki:
20140630 21:11:40
python i m still getting wrong ans..plz help me.. 

viki:
20140630 21:11:40
i m getting all test cases correct still getting wa..plz help...is there any trick in this ques..?


Karthikeyan.k:
20140630 21:11:40
Passed all test cases...Still not AC :(

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