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

ll a_even[10] = {4,4,3,3,2,2,1,1,0,0};   //a_even[i] represents no.of even nums after i (not including)
ll a_odd[10] = {5,4,4,3,3,2,2,1,1,0};    //a_odd[i] denotes no.of odd integers after i (not including i)

bool extraa(ll num){                    //this functions just checks if given 'l' is boring or not
    string s = to_string(num);
    int flag = 1;
    for(int i=0;s[i];++i){
        if(i&1){
            if((s[i]-'0')&1)flag=0;
        }
        else {
            if((s[i]-'0')%2==0)flag=0;
        }
        if(flag==0)return false;
    }
    return true;
}

int main(){
    int t;
    cin>>t;
    for(int test = 1;test<=t;++test){
        cout<<"Case #"<<test<<": ";
        
        ll l,r;     cin>>l>>r;        
        ll ans = 0;
        
        string s1 = to_string(l); 
        string s2 = to_string(r);
        
        ll count1 = s1.length();
        ll count2 = s2.length();
        
        for(ll i=count1+1;i<count2;++i){    //no.of boring numbers = 5 pow x, where x is no.of digits
            ans = ans + pow(5,i);
        }

        ll x = 0 ;      // x stores the no.of boring integers from l part  
        ll y = 0 ;      // y stores the no.of boring integers from r part  
        ll poww = 0;

        for(int i=s1.length()-1;i>=0;--i){
            if(i&1){
                x = x + a_even[s1[i]-'0']*pow(5,poww);    
            }
            else x = x + a_odd[s1[i]-'0']*pow(5,poww);
            poww++;
        }
        
        poww = 0;

        for(int i=s2.length()-1;i>=0;--i){
            if(i&1){
                y = y + a_even[s2[i]-'0']*pow(5,poww);
            }
            else y = y + a_odd[s2[i]-'0']*pow(5,poww);
            poww++;
        }
        
        if(extraa(l)) x++;           //just checking if 'l' is boring or not
    
        if(count1!=count2){
            y = pow(5,count2) - y;
            ans = ans + x + y;
        }
        else {
            ans = ans + x - y;
        }
        cout<<ans<<endl;
        
    }
    return 0;
}

...

 public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		int t = scn.nextInt();
		int x = 1;
		while (t > 0) {
			int n = scn.nextInt();
			Point[] arr = new Point[n];
			for (int i = 0; i < n; ++i) {
				arr[i] = new Point(scn.nextInt(), scn.nextInt(), i);
			}
			System.out.println("Case #" + x + ": " + solve(n, arr));
			t--;
			x++;
		}
	}

	public static long solve(int n, Point[] arr) {
		Arrays.sort(arr, new yCom());
		int yMed = arr[n / 2].y;
		long ans = 0;
		Arrays.sort(arr, new xCom());
		int xMed = arr[n / 2].x;
		int i=n/2;
		while(i>=0) {
			int x=arr[i].x;
			int y=arr[i].y;
			ans+=Math.abs(yMed-y);
			ans+=Math.abs(xMed-x);
			xMed--;
			i--;
		}
		xMed=arr[n/2].x+1;
		i=n/2+1;
		while(i<n) {
			int x=arr[i].x;
			int y=arr[i].y;
			ans+=Math.abs(yMed-y);
			ans+=Math.abs(xMed-x);
			xMed++;
			i++;
		}
		return ans;
	}

	public static class xCom implements Comparator<Point> {

		@Override
		public int compare(Point arg0, Point arg1) {
			// TODO Auto-generated method stub
			return arg0.x - arg1.x;
		}

	}

	public static class yCom implements Comparator<Point> {

		@Override
		public int compare(Point arg0, Point arg1) {
			// TODO Auto-generated method stub
			return arg0.y - arg1.y;
		}

	}

	public static class Point {
		int x;
		int y;
		int id;

		Point(int x, int y, int id) {
			this.x = x;
			this.y = y;
			this.id = id;
		}
	}

	static Reader scn = new Reader();
	static OutputStream out = new BufferedOutputStream(System.out);

Your code here...

void solve () {
	ll n;
	cin >> n;
	vector<ll> x(n),y(n);
	for (int i = 0;i < n;++i) {
		cin >> x[i] >> y[i];
	}
	sort(all(x));
	sort(all(y));
	ll finalY = y[n/2];
	ll startX = x[n/2]-n/2;
	ll ans = 0;
	for (int i = 0;i < n;++i) {
		ans += abs(x[i]-startX)+abs(y[i]-finalY);
		++startX;
	}
	cout << ans << '\n';

}

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

#define ll long long
#define MOD 1000000007

#define endl '\n'
#define in(x, n) for(int e=0; e<n; e++){ll y;cin >> y; x.pb(y);}
#define print(x) for(auto it:x)cout << it<< ' '; cout << endl;

#define vi vector<ll>
#define vvi vector<vi>
#define ii pair<ll, ll>
#define pll pair<ll, ll>
#define pb push_back
#define F first
#define S second

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t;
    cin >> t;
    for (int case_num = 1; case_num <= t; case_num ++) {
    	int n;
    	cin >> n;
    	vi x(n), y(n);
    	for(int i = 0; i < n; i++){
    		cin >> x[i] >> y[i];
    	}
    	sort(x.begin(), x.end());
    	// for(int i = 0; i < n; i++){
    	// 	x[i] -= i;
    	// }
    	// sort(x.begin(), x.end());
    	sort(y.begin(), y.end());
    	ll mx = x[(n-1)/2] - floor((n-1)/2);
    	// ll mx = x[(n-1)/2];
    	ll my = y[(n-1)/2];
    	ll ans = 0;
    	for(int i = 0; i< n; i++){
    		ans += abs(my - y[i]);
    		// ans += abs(mx - (n-1)/2 + i - x[i]);
    		ans += abs(mx - x[i] + i);
    	}
		cout << "Case #" << case_num << ": " << ans << '\n';
	}
    return 0;
}