1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int consec(int a,int b,int c,int n){
  5. 	priority_queue<int> pq;
  6. 	pq.push(a);
  7. 	pq.push(b);
  8. 	pq.push(c);
  9. 	int x=0,y=0,z=0;
  10. 	z = pq.top();pq.pop();
  11. 	y = pq.top();pq.pop();
  12. 	x = pq.top();pq.pop();
  13. 	if(x>n || x<1 || y>n || y<1 || z>n || z<1)
  14. 		return 0;
  15. 	if(y-x == 1 && z-y==1)
  16. 		return 1;
  17. 	return 0;
  18. }
  19.  
  20. void mainSolve()
  21. {
  22. 	int n,a,b;
  23. 	cin >> n >> a >> b;
  24. 	int mi = min(a,b);int ma = max(a,b);
  25. 	int req = consec(a,b,mi-1,n)+consec(a,b,ma+1,n)+consec(a,b,mi+1,n);
  26. 	cout << req << endl;
  27. }
  28.  
  29. int main()
  30. {
  31.   int t;
  32.   cin >> t;
  33.   while (t--)
  34.   {
  35.     mainSolve();
  36.   }
  37.   return 0;
  38. }