/* realRPG | India */ #include "bits/stdc++.h" #define ll unsigned long long #define vi vector #define vs vector #define vll vector #define vpii vector > #define vpss vector > #define vpll vector > #define pii pair #define pll pair #define pss pair #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define fi(i,a,b,c) for(int i=a; i=b; i-=c) #define rfl(i,a,b,c) for(long long i=a; i>=b; i-=c) #define pb push_back #define mk make_pair #define ep emplace_back #define F first #define S second using namespace std; const ll md = 1e9 + 7; const ll MAX = 1e5 + 5; const ll MAXN = 1e6 + 10; /*inline ll fsc() { ll ip = getchar(), ret = 0, flag = 1; for (; ip<'0' || ip>'9'; ip = getchar()) if (ip == '-') { flag = -1; ip = getchar(); break; } for (; ip >= '0'&&ip <= '9'; ip = getchar()) ret = ret * 10 + ip - '0'; return flag*ret; }*/ ll ar[6]={0}; ll ct=0; void fun(ll a,ll b,ll c,ll d) { if(a==c && b==d) { return; } if(ca) { if(d>=b) { ar[3]+=1; ct++; a+=2; b+=1; fun(a,b,c,d); } else { ar[4]+=1; ct++; a+=2; b-=1; fun(a,b,c,d); } } else if(b1) { ar[2]+=1; ct++; b+=2; fun(a,b,c,d); } else if(d1) { ar[5]+=1; ct++; b-=2; fun(a,b,c,d); } } void solve() { ll n; cin >>n; ll a,b,c,d; cin >>a>>b>>c>>d; ll flaga=a%2; ll flagb=b%2; ll flagm=0; if(flaga==c%2) { if((c-a)%4==0) { if(flagb==d%2) { flagm=1; fun(a,b,c,d); cout <