You are given circle $A$ with radius $r_a$ and with central coordinate $(x_a, y_a)$ and circle $B$ with radius $r_b$ and with central coordinate $(x_b, y_b)$.

Write a program which prints:

* "2" if $B$ is in $A$,
* "-2" if $A$ is in $B$,
* "1" if circumference of $A$ and $B$ intersect, and
* "0" if $A$ and $B$ do not overlap.



You may assume that $A$ and $B$ are not identical.



Input

The input consists of multiple datasets. The first line consists of an integer $N$ ($N \leq 50$), the number of datasets. There will be $N$ lines where each line represents each dataset. Each data set consists of real numbers:

$x_a$ $y_a$ $r_a$ $x_b$ $y_b$ $r_b$

Output

For each dataset, print 2, -2, 1, or 0 in a line.

Example

Input

2
0.0 0.0 5.0 0.0 0.0 4.0
0.0 0.0 2.0 4.1 0.0 2.0


Output

2
0
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;



public class Main {
	public static void main(String[] args) {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String line = null;

		double xa, ya, ra, xb, yb, rb;
		try {
			line = br.readLine();
			line.trim();
			int N = Integer.parseInt(line);
			for(int i = 0; i < N; i++){
				line = br.readLine();
				line.trim();
				
				String[] words = line.split("\\s");
				xa = Double.parseDouble(words[0]);
				ya = Double.parseDouble(words[1]);
				ra = Double.parseDouble(words[2]);
				xb = Double.parseDouble(words[3]);
				yb = Double.parseDouble(words[4]);
				rb = Double.parseDouble(words[5]);

				int ans = -1;
				double distance = Math.sqrt(Math.pow(xa - xb, 2) + Math.pow(ya - yb, 2));
				
				if(distance > ra + rb) ans = 0;
				else if(ra > distance + rb) ans = 2;
				else if(rb > distance + ra) ans = -2;
				else ans = 1;
				System.out.println(ans);

			}
		} catch (IOException e) {
			e.printStackTrace();
		}
	}

}