#include <bits/stdc++.h>
using namespace std;
void bug() { cout << "here\n"; }
template <typename T>
inline T S(T a) {
  return a * a;
}
template <class T>
inline string tostring(T a) {
  ostringstream os("");
  os << a;
  return os.str();
}
template <typename T>
inline long long tolong(T a) {
  long long res;
  istringstream os(a);
  os >> res;
  return res;
}
template <typename T>
inline T gcd(T a, T b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
template <typename T>
inline T bigmod(T a, T b, T m) {
  if (b == 0)
    return 1;
  else if (b % 2 == 0)
    return S(bigmod(a, b / 2, m)) % m;
  else
    return (a % m * bigmod(a, b - 1, m)) % m;
}
const int inf = (int)1e9 + 5;
const long long linf = (long long)1e16 + 5;
const long long modd = (long long)1e9 + 7;
const int mod = 10000007;
bool prime[10000009];
vector<long long> prm;
void seive() {
  memset(prime, true, sizeof(prime));
  for (long long i = 2; i * i <= 10000009; i++) {
    if (prime[i] == true) {
      prm.push_back(i);
      for (long long j = i * i; j <= 10000009; j += i) prime[j] = false;
    }
  }
}
void pr(int f) {
  if (f == 1)
    cout << "YES\n";
  else
    cout << "NO\n";
}
bool isprime(long long n) {
  if (n < 2) return 0;
  if (n == 2)
    return 1;
  else {
    for (int i = 2; i * i <= n; i++)
      if (n % i == 0) return 0;
  }
  return 1;
}
long long countSum(long long x) {
  long long res = 0;
  while (x != 0) {
    res += (x % 10);
    x /= 10;
  }
  return res;
}
const int nx = 2e5 + 5;
int tt[nx];
int main() {
  ios_base::sync_with_stdio(0);
  int x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;
  cout << max(abs(x1 - x2), abs(y1 - y2)) << "\n";
}
