#include <bits/stdc++.h>
using namespace std;
int a[300001];
int b[300001];
int c[300001];
int d[300001];
multiset<int> st1, st2, st3, st4;
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i] >> b[i] >> c[i] >> d[i];
    st1.insert(a[i]);
    st2.insert(b[i]);
    st3.insert(c[i]);
    st4.insert(d[i]);
  }
  for (int i = 1; i <= n; i++) {
    st1.erase(st1.find(a[i]));
    st2.erase(st2.find(b[i]));
    st3.erase(st3.find(c[i]));
    st4.erase(st4.find(d[i]));
    int l = *st1.rbegin();
    int f = *st2.rbegin();
    int r = *st3.begin();
    int u = *st4.begin();
    if (l <= r && f <= u) {
      cout << l << ' ' << f;
      return 0;
    }
    st1.insert(a[i]);
    st2.insert(b[i]);
    st3.insert(c[i]);
    st4.insert(d[i]);
  }
  return 0;
}
