A.cpp

/*****                                            
 *                                                   __Bismillahir Rahmanir Rahim__
 *                                          American International University Bangladesh (AIUB) 
 *                                                         Hadiur Rahman Nabil
                                                                 
                                                               
                                                          
*****/
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'

typedef long long ll;
typedef long double ld;

//Palindrome--
// for(int i=s.size()-1;i>=0;--i){s_rev.push_back(s[i]);} if(s==s_rev)    
 //Anagram--
 //sort(a.begin(), a.end());sort(b.begin(), b.end());if(a==b)
  
//Find_Last + Delete_Last--
//num%10    +   num/10
//Fibonacci--
//for(int i=1;i<=N-2;i++){ num3=num1(1)+num2(2);num1=num2;num2=num3(Fibonacci);


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
   
        ll t,xa,xb,xc,xd,ya,yb,yc,yd,ans;
        cin>>t;
        for(int i = 0;i<t;i++)
        {
            cin>>xa>>ya>>xb>>yb>>xc>>yc;
            ans=0;
        
            ans+= abs(xa-xb) + abs(ya-yb);
        
           if(xa==xc && xb==xc)
           {
               ll minY = min(ya,yb);
               ll maxY= max(ya,yb);
               if(yc>minY && yc<maxY)
               {
                   ans+=2;
               }
           }
        
        

    else if(ya==yc && yb==yc)
           {
               ll minX = min(xa,xb);
               ll maxX= max(xa,xb);
               if(xc>minX && xc<maxX)
               {
                   ans+=2;
               }
           }
        
        
           
           
cout<<ans<<endl;


        
        
        
        
        
       
          
         
}
}