【链接】 我是链接,点我呀:)
【题意】

【题解】

【代码】

#include <bits/stdc++.h>
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define all(x) x.begin(),x.end()
#define pb push_back
#define lson l,mid,rt<<1
#define ri(x) scanf("%d",&x)
#define rl(x) scanf("%lld",&x)
#define rs(x) scanf("%s",x)
#define rson mid+1,r,rt<<1|1
using namespace std;

const double pi = acos(-1);
const int dx[4] = {0,0,1,-1};
const int dy[4] = {1,-1,0,0};
const int N = 2e5;
const int INF = 1e9+7;

struct abc{
    int x1,x2;
    int y1,y2;
}a[N+10];

int premax[N+10][2],premin[N+10][2],aftmax[N+10][2],aftmin[N+10][2];
int n;

int main(){
	#ifdef LOCAL_DEFINE
	    freopen("rush_in.txt", "r", stdin);
	#endif
    ri(n);
    rep1(i,1,n) ri(a[i].x1),ri(a[i].y1),ri(a[i].x2),ri(a[i].y2);
    rep1(i,0,1) premax[0][i] = -INF,premin[0][i] = INF;
    rep1(i,0,1) aftmax[n+1][i] = -INF,aftmin[n+1][i] = INF;
    rep1(i,1,n){
        premax[i][0] = max(premax[i-1][0],a[i].x1);
        premax[i][1] = max(premax[i-1][1],a[i].y1);
        premin[i][0] = min(premin[i-1][0],a[i].x2);
        premin[i][1] = min(premin[i-1][1],a[i].y2);
    }
    rep2(i,n,1){
        aftmax[i][0] = max(aftmax[i+1][0],a[i].x1);
        aftmax[i][1] = max(aftmax[i+1][1],a[i].y1);
        aftmin[i][0] = min(aftmin[i+1][0],a[i].x2);
        aftmin[i][1] = min(aftmin[i+1][1],a[i].y2);
    }
    rep1(i,1,n){
        int x1 = max(premax[i-1][0],aftmax[i+1][0]);
        int y1 = max(premax[i-1][1],aftmax[i+1][1]);
        int x2 = min(premin[i-1][0],aftmin[i+1][0]);
        int y2 = min(premin[i-1][1],aftmin[i+1][1]);
        if (x1<=x2 && y1<=y2){
            cout<<x1<<' '<<y1<<endl;
            return 0;
        }
    }
	return 0;
}