#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

struct Circle
{
	double x, y, r;
};

int main()
{
	int n;
	cin >> n;
	
	rep(i, n)
	{
		Circle a, b;
		cin >> a.x >> a.y >> a.r >> b.x >> b.y >> b.r;

		double d = sqrt(pow(a.x - b.x, 2.0) + pow(a.y - b.y, 2.0));

		if(a.r + b.r < d)
			cout << 0 << endl;
		else if(d < a.r - b.r)
			cout << 2 << endl;
		else if(d < b.r - a.r)
			cout << -2 << endl;
		else
			cout << 1 << endl;
	}
}