//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int dist[144][144][144];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	memset(dist,0x3f,sizeof(dist));
	for(int i=1;i<144;i++)
	{
		for(int j=1;j<=i;j++)
			dist[i][j][j]=0;
		for(int j=1;j<=i;j++)
			for(int k=j+1;k<=i;k++)
				if((j+i)%k==0)
					dist[i][j][k]=dist[i][k][j]=1;
		for(int a=1;a<=i;a++)
			for(int b=1;b<=i;b++)
				for(int c=1;c<=i;c++)
					dist[i][b][c]=min(dist[i][b][c],dist[i][b][a]+dist[i][a][c]);
	}
	while(t--)
	{
		ll n,u,v;
		cin>>n>>u>>v;
		if(n<=140) cout<<(dist[n][u][v]==0x3f3f3f3f?-1:dist[n][u][v])<<'\n';
		else if(u==v) cout<<"0\n";
		else if(u==n||v==n) cout<<"-1\n";
		else if((min(u,v)+n)%max(u,v)==0) cout<<"1\n";
		else cout<<"2\n";
	}
	return 0;
}