#include <bits/stdc++.h>
using namespace std;
const long long Maxn = 200 * 1000 + 1;
const long double pi = acos(-1);
const long long mod = 1000000007;
template <class T>
ostream &operator<<(ostream &out, vector<T> &A) {
  for (auto x : A) out << x << " ";
  return out;
}
template <class T>
ostream &operator<<(ostream &out, set<T> &A) {
  for (auto x : A) out << x << " ";
  return out;
}
template <class T1, class T2>
T1 powr(T1 a, T2 b) {
  T1 res = 1;
  for (long long i = 1; i < b + 1; i++) res = res * a;
  return res;
}
long long roundUp(long long numToRound, long long multiple) {
  if (multiple == 0) {
    return numToRound;
  }
  long long roundDown = ((long long)(numToRound) / multiple) * multiple;
  long long roundUp = roundDown + multiple;
  long long roundCalc = roundUp;
  return (roundCalc);
}
long long calc(long long a, long long b, long long c) {
  return abs(a - b) + abs(a - c) + abs(b - c);
}
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long gcd(long long a, long long b) {
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
bool isSubSequence(string str1, string str2) {
  long long m = str1.length(), n = str2.length();
  long long j = 0;
  for (long long i = 0; i < n && j < m; i++)
    if (str1[j] == str2[i]) j++;
  return (j == m);
}
void eraseAllSubStr(string &mainStr, string &toErase) {
  size_t pos = std::string::npos;
  while ((pos = mainStr.find(toErase)) != std::string::npos) {
    mainStr.erase(pos, toErase.length());
    mainStr.insert(pos, " ");
  }
}
long long isSubstring(string s1, string s2) {
  long long M = s1.length();
  long long N = s2.length();
  for (long long i = 0; i <= N - M; i++) {
    long long j;
    for (j = 0; j < M; j++)
      if (s2[i + j] != s1[j]) break;
    if (j == M) return i;
  }
  return -1;
}
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long r1, c1, r2, c2;
  cin >> r1 >> c1 >> r2 >> c2;
  if (r1 == r2 || c1 == c2)
    cout << 1 << " ";
  else
    cout << 2 << " ";
  if ((r1 + c1) % 2 != (r2 + c2) % 2)
    cout << 0;
  else {
    if (r1 + c1 == r2 + c2 || r1 - c1 == r2 - c2)
      cout << 1;
    else
      cout << 2;
  }
  cout << " ";
  cout << max(abs(r1 - r2), abs(c1 - c2));
}
