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
atulsinha007:
20160131 07:40:11
nice and easy one.. though 2 WA's :( 

rajat:
20150820 20:48:28
easy one


goyal:
20150719 12:39:05
AC:) using maps 

ashish22_dwd:
20150707 19:54:48
why i m getting WA.. plz check my code http://ideone.com/ZMNkvk 

kp:
20150706 09:09:42
good one, try


Akshit Johry:
20150604 21:19:06
AC solution...


shubhankaryash:
20150603 17:30:14
I am getting SIGSEGV. Can someone plz tell me where the segmentation fault is?? http://ideone.com/u4ygLv Last edit: 20150603 17:37:39 

kartikay singh:
20150526 14:31:08
Easy AC in 1 go :D


Anmol Pandey:
20150124 23:47:37
To those getting WA or Runtime Error

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