#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <set>
#include <vector>
#include <queue>
#include <map>
#include <numeric>
#include <math.h>
#include <complex>

using namespace std;

#define rep(i, n) for (long long int i = 0; i < (long long int)(n); i++)
#define irep(i, n) for (long long int i = 1; i <= (long long int)(n); i++)
#define drep(i, n, diff) for (long long int i = 0; i < (long long int)(n); i += diff)
#define mod 1000000007
#define INF 100100100100100101
#define ld(val) printf("%s : %lld\n", #val, val);
#define sd(val) printf("%s : %s\n", #val, val);

typedef long long int ll;
typedef pair<ll, ll> P;
typedef pair<P, P> PP;
typedef tuple<ll, ll, ll> TP;

int main() {
  ll n, k;
  cin >> n >> k;
  rep(i, k) {
    if(n%200==0){
      n/=200;
    }else{
      n*=1000;
      n+=200;
    }
  }
  cout << n << endl;
  return 0;
}

#include<bits/stdc++.h>
#define ll long long 
#define mp make_pair 
#define f(i,n) for(int i=0;i<n;i++) 
#define F first 
#define S second 
#define pb push_back 

using namespace std;

pair<int,int> fun(int a, int b){
	return {min(a,b),max(a,b)};
}

bool comp(pair<pair<ll,ll> ,int > a ,pair<pair<ll,ll> ,int > b ){
	return a.F.F<b.F.F;
}

bool comp2(pair<pair<ll,ll> ,int > a ,pair<pair<ll,ll> ,int > b ){
	return a.F.S<b.F.S;
}

void test(){
	ll n;
	cin>>n;
	ll x[n],y[n];
	f(i,n)cin>>x[i]>>y[i];
	
	vector<pair<pair<ll,ll>,int> > v;
	
	f(i,n)v.pb({{x[i],y[i]},i});
	
	sort(v.begin(),v.end(),comp);
	
	
	set<pair<int,int> > st;
	
	st.insert(fun(v[0].S,v[n-1].S));
	st.insert(fun(v[0].S,v[n-2].S));
	st.insert(fun(v[1].S,v[n-1].S));
	
	sort(v.begin(),v.end(),comp2);
	
	st.insert(fun(v[0].S,v[n-1].S));
	st.insert(fun(v[0].S,v[n-2].S));
	st.insert(fun(v[1].S,v[n-1].S));
	
	
	vector<ll> dis;
	
	for(auto z : st){
		dis.pb(max(abs(x[z.F]-x[z.S]), abs(y[z.F]-y[z.S])));
	}
	
	sort(dis.rbegin(),dis.rend());
	
	cout<<dis[1]<<"\n";
	
	
	
	
}

int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tests=1;
	// cin>>tests;
	while(tests--){
		test();
	}
}
