#include <bits/stdc++.h>
using namespace std;

int consec(int a,int b,int c,int n){
	priority_queue<int> pq;
	pq.push(a);
	pq.push(b);
	pq.push(c);
	int x=0,y=0,z=0;
	z = pq.top();pq.pop();
	y = pq.top();pq.pop();
	x = pq.top();pq.pop();
	if(x>n || x<1 || y>n || y<1 || z>n || z<1)
		return 0;
	if(y-x == 1 && z-y==1)
		return 1;
	return 0;
}

void mainSolve()
{
	int n,a,b;
	cin >> n >> a >> b;
	int mi = min(a,b);int ma = max(a,b);
	int req = consec(a,b,mi-1,n)+consec(a,b,ma+1,n)+consec(a,b,mi+1,n);
	cout << req << endl;
}

int main()
{
  int t;
  cin >> t;
  while (t--)
  {
    mainSolve();
  }
  return 0;
}