#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
#include<list>

using namespace std;

typedef  long long int lint;

#define rep(i, n) for (lint i = 0; i < n; i++)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define mp make_pair
#define IP pair<int,int>
#define enld endl

double len(double xa, double ya, double xb, double yb) {
	double ans = 0;
	ans = sqrt(pow((xa - xb), 2) + pow((ya - yb), 2));
	return ans;
}

int main() {
	lint N;
	cin >> N;
	double xa, ya, ra, xb, yb, rb;
	rep(i, N) {
		cin >> xa >> ya >> ra >> xb >> yb >> rb;
		if (len(xa, ya, xb, yb) + ra < rb) {
			cout << -2 << endl;
		}
		else if (len(xa, ya, xb, yb) + rb < ra) {
			cout << 2 << endl;
		}
		else if (len(xa, ya, xb, yb) > ra + rb) {
			cout << 0 << enld;
		}
		else {
			cout << 1 << endl;
		}
	}
}
