1028C：Rectangles

You are given n rectangles on a plane with coordinates of their bottom left and upper right points. Some (n−1) of the given n

rectangles have some common point. A point belongs to a rectangle if this point is strictly inside the rectangle or belongs to its boundary.

Find any point with integer coordinates that belongs to at least (n−1)

given rectangles.
Input

The first line contains a single integer n(2≤n≤132674) — the number of given rectangles.

Each the next n lines contains four integers x1, y1, x2 and y2 (−109≤x1<x2≤109, −109≤y1<y2≤109) — the coordinates of

the bottom left and upper right corners of a rectangle.
Output

Print two integers x
and y — the coordinates of any point that belongs to at least (n−1)

given rectangles.
Examples

Input

Copy

3
0 0 1 1
1 1 2 2
3 0 4 1

Output

Copy

1 1

Input

Copy

3
0 0 1 1
0 1 1 2
1 0 2 1

Output

Copy

1 1

Input

Copy

4
0 0 5 5
0 0 4 4
1 1 4 4
1 1 4 4

Output

Copy

1 1

Input

Copy

5
0 0 10 8
1 2 6 7
2 3 5 6
3 4 4 5
8 1 9 2

Output

Copy

3 4

Note

The picture below shows the rectangles in the first and second samples. The possible answers are highlighted.

The picture below shows the rectangles in the third and fourth samples.

暴力枚举+线段树优化
只要满足左下角的坐标的最小值大于等于右上角的坐标的最大值一定有公共区间

#include <bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
int a[][],n;
int tree[][<<];
void build(int l,int r,int root,int dep)
{
    tree[dep][root]=dep>?INF:-INF;
    if(l==r){
        tree[dep][root]=a[l][dep];
        return ;
    }
    int mid=l+r>>;
    build(l,mid,root<<,dep);
    build(mid+,r,root<<|,dep);
    tree[dep][root]=dep>?min(tree[dep][root<<],tree[dep][root<<|]):max(tree[dep][root<<],tree[dep][root<<|]);
}
int query(int l,int r,int root,int L,int R,int dep)
{
    if(L>R) return dep>?INF:-INF;
    if(L<=l && R>=r){
        return tree[dep][root];
    }
    int ans=dep>?INF:-INF,mid=l+r>>;
    if(L<=mid) ans=dep>?min(ans,query(l,mid,root<<,L,R,dep)):max(ans,query(l,mid,root<<,L,R,dep));
    if(R>mid) ans=dep>?min(ans,query(mid+,r,root<<|,L,R,dep)):max(ans,query(mid+,r,root<<|,L,R,dep));
    return ans;
}
int main()
{
    scanf("%d",&n);
    for(int i=;i<=n;i++){
        for(int j=;j<;j++)
            scanf("%d",&a[i][j]);
    }
    for(int i=;i<;i++)
        build(,n,,i);
    for(int i=;i<=n;i++)
    {
        int b[];
        for(int j=;j<;j++){
            if(j>) b[j]=min(query(,n,,,i-,j),query(,n,,i+,n,j));
            else b[j]=max(query(,n,,,i-,j),query(,n,,i+,n,j));
        }
        if(b[]<=b[] && b[]<=b[]) return printf("%d %d\n",b[],b[]),;
    }
    return ;
}