For this Question: Given N nodes numbered from 1 to N. Find the shortest distance from A to B. There is an undirected edge of cost 1 between nodes i and j, if the number of bits set in (i xor j) is 2. If we cannot reach from A to B report -1.First line of input contains a single integer T, number of testcases.
Next T lines contain three integers N, A, and B.

Contraints:
1 <= T <= 10
1 <= N <= 1000000
1 <= A, B <= NFor each test case print a single integer which is the shortest distance between A and B in a new line.
Note:- If B is unreachable from A print -1 instead of shortest distance.Sample Input
2
7 1 7
3 1 3

Sample Output
1
-1, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc  __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
    return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
 
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> oset;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
 
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define f80 __float128
#define pii pair<int,int>
using namespace std;


signed main() {
	fastio;
	#ifdef ANIKET_GOYAL
		freopen("inputf.in","r",stdin);
		freopen("outputf.in","w",stdout);
	#endif
	int t;
	cin>>t;
	while(t){
		--t;
		int n,a,b;
		cin>>n>>a>>b;
		if(__builtin_popcountll(a^b)%2==1){
			cout<<"-1\n";
		}
		else{
			cout<<__builtin_popcountll(a^b)/2<<"\n";
		}
	}
	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?