#include<bits/stdc++.h>
using namespace std;
const int N = 1e5+ 5;
struct points{
int x, y;
bool type;
int id;
bool operator <(points oth) const{
if(y == oth.y)
return id < oth.id;
return y < oth.y;
}
};
set<points> act;
pair<int, int> upper[N], lower[N];
bool cmp(points a, points b){
if(a.x == b.x)
return a.type < b.type;
return a.x < b.x;
}
int v[N][4];
int main()
{
//freopen(".in","r",stdin);
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
int n;
cin>>n;
vector<points> ev;
for(int i =1 ; i <=n; i++){
int x1, y1, x2, y2;
cin>>x1>>y1>>x2>>y2;
if(x1 >x2){
swap(x1, x2);
swap(y1, y2);
}
v[i][0] = x1;
v[i][1] = y1;
v[i][2] = x2;
v[i][3] = y2;
ev.push_back({x1, y1, false, i});
ev.push_back({x2, y2, true, i});
}
sort(ev.begin(), ev.end(), cmp);
for(auto e : ev){
if(e.type == false){
pair<int, int> last = {INT_MIN, INT_MIN};
auto nxt = act.upper_bound({e});
if(nxt != act.end()){
last = upper[(*nxt).id];
upper[(*nxt).id] = {e.x, e.y};
}
if(nxt != act.begin()){
nxt = prev(nxt);
if(lower[(*nxt).id].first > last.first)
last = lower[(*nxt).id];
lower[(*nxt).id] = {e.x, e.y};
}
if(last.first != INT_MIN){
cout<<last.first<<" "<<last.second<<" "<<e.x<<" "<<e.y<<"\n";
}
act.insert({e.x, e.y, 0, e.id});
upper[e.id] = {e.x, e.y};
lower[e.id] = {e.x, e.y};
}
else{
auto itr = act.find({v[e.id][0], v[e.id][1], 0, e.id});
assert(itr != act.end());
auto nxt = next(itr);
if(nxt != act.end()){
upper[(*nxt).id] = {e.x, e.y};
}
if(itr != act.begin()){
nxt = prev(itr);
lower[(*nxt).id] = {e.x, e.y};
}
act.erase({v[e.id][0], v[e.id][1], 0, e.id});
}
}
return 0;
}
