t=int(input())
for j in range(t):
input()
xa,ya=[int(i) for i in input().split()]
xb,yb=[int(i) for i in input().split()]
xf,yf=[int(i) for i in input().split()]
if not ((xa==xb==xf and (ya<yf<yb or ya>yf>yb)) or (ya==yb==yf and (xa<xf<xb or xa>xf>xb))):
print(abs(xa-xb)+abs(ya-yb))
else:
print(abs(xa-xb)+abs(ya-yb)+2)#include<bits/stdc++.h>
using namespace std;
void solve()
{
int xa,ya,xb,yb,fa,fb;
cin >> xa >> ya >> xb >> yb >> fa >> fb;
int res=abs(xa-xb)+abs(ya-yb);
if(xa==xb&&xa==fa)
{
if((ya>fb&&yb<fb)||(ya<fb&&yb>fb)) res+=2;
}
if(ya==yb&&yb==fb)
{
if((xa>fa&&xb<fa)||(xa<fa&&xb>fa)) res+=2;
}
cout << res << endl;
}
int main()
{
int _;
cin >> _;
while(_--)
{
solve();
}
}967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |