Match Maker

All submissions for this problem are available.
Little Mojo owns a match making company, which even to her surprise is an extreme hit. She says that her success rate cannot be matched (Yeah, wordplay!) in the entire matchmaking industry. She follows an extremely simple algorithm to determine if two people are matches for each other. Her algorithm is not at all complex, and makes no sense  not even to her. But she uses it anyway.
Let's say say that on a given day she decides to select n people  that is, n boys and n girls. She gets the list of n boys and n girls in a random order initially. Then, she arranges the list of girls in ascending order on the basis of their height and boys in descending order of their heights. A girl Ai can be matched to a boy on the same index only, that is, Bi and no one else. Likewise, a girl standing on Ak can be only matched to a boy on the same index Bk and no one else.
Now to determine if the pair would make an ideal pair, she checks if the modulo of their heights is 0, i.e., Ai % Bi == 0 or Bi % Ai == 0. Given the number of boys and girls, and their respective heights in nonsorted order, determine the number of ideal pairs Mojo can find.
.
Input
Input description.
Tips:
 The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows."
 The input of each test is an array you could write it like this: "The first line of each test case contains a single integer N denoting the number of Boys and Girls.
 The next line contains the height of girls, followed by the height of boys.
Output
Output description.
Tips:
 Print the number of ideal pairs corresponding to every test case.
Constraints
Should contain all the constraints on the input data that you may have. Format it like:
 1 ≤ Test Cases ≤ 102
 1 ≤ N ≤ 104
 1 ≤ Ai,Bi ≤ 105
Example
Input: 2 4 1 6 9 12 4 12 3 9 4 2 2 2 2 2 2 2 2 Output: 2 4
Author:  hacky301 
Tags  hacky301 
Date Added:  17022015 
Time Limit:  2 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, JAVA, PYTH, PYTH 3.5, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 