#include <bits/stdc++.h>
using namespace std;
const long long mod = (long long)1e9 + 7;
const long long inf = (long long)1e16;
const long double eps = 1e-12;
const long long N = (int)1.5e5 + 5;
const long long LOGN = 19;
const long double PI = 3.14159265358979323846;
inline long long mul(long long a, long long b, long long m = mod) {
  return (long long)(a * b) % m;
}
inline long long add(long long a, long long b, long long m = mod) {
  a += b;
  if (a >= m) a -= m;
  if (a < 0) a += m;
  return a;
}
inline long long power(long long a, long long b, long long m = mod) {
  if (b == 0) return 1;
  if (b == 1) return (a % m);
  long long x = power(a, b / 2, m);
  x = mul(x, x, m);
  if (b % 2) x = mul(x, a, m);
  return x;
}
int n;
vector<pair<pair<int, int>, pair<int, int> > > dp_pre(N), dp_post(N);
vector<pair<pair<int, int>, pair<int, int> > > a;
pair<pair<int, int>, pair<int, int> > intersect(
    pair<pair<int, int>, pair<int, int> >& L,
    pair<pair<int, int>, pair<int, int> >& R) {
  pair<pair<int, int>, pair<int, int> > ret;
  ret = L;
  ret.first.first = max(ret.first.first, R.first.first);
  ret.first.second = max(ret.first.second, R.first.second);
  ret.second.first = min(ret.second.first, R.second.first);
  ret.second.second = min(ret.second.second, R.second.second);
  return ret;
}
bool valid(pair<pair<int, int>, pair<int, int> >& p) {
  if (p.first.first > p.second.first) return false;
  if (p.first.second > p.second.second) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  if (0) {
    freopen("C:\\Users\\Dishant\\Desktop\\Collection-DEV c++\\input.txt", "r",
            stdin);
    freopen("C:\\Users\\Dishant\\Desktop\\Collection-DEV c++\\output.txt", "w",
            stdout);
  }
  cin >> n;
  for (int i = 0; i < n; i++) {
    int x1, x2, y1, y2;
    cin >> x1 >> y1 >> x2 >> y2;
    a.push_back({{x1, y1}, {x2, y2}});
  }
  sort(a.begin(), a.end());
  dp_pre[0] = a[0];
  dp_post[n - 1] = a[n - 1];
  for (int i = 1; i <= n - 1; i++) {
    pair<pair<int, int>, pair<int, int> > to = intersect(dp_pre[i - 1], a[i]);
    dp_pre[i] = to;
  }
  for (int i = n - 1 - 1; i >= 0; i--) {
    pair<pair<int, int>, pair<int, int> > to = intersect(dp_post[i + 1], a[i]);
    dp_post[i] = to;
  }
  if (valid(dp_post[1])) {
    cout << dp_post[1].first.first << " " << dp_post[1].first.second << endl;
    return 0;
  }
  if (valid(dp_pre[n - 2])) {
    cout << dp_pre[n - 2].first.first << " " << dp_pre[n - 2].first.second
         << endl;
    return 0;
  }
  for (int i = 1; i <= n - 2; i++) {
    pair<pair<int, int>, pair<int, int> > to = dp_pre[i - 1];
    to = intersect(to, dp_post[i + 1]);
    if (valid(to)) {
      cout << to.first.first << " " << to.first.second << endl;
      return 0;
    }
  }
  cout << "FAIL\n";
  return 0;
}
