#include <map>
#include <cmath>
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

const int N = 1e5;
const int inf = 0x3f3f3f3f;

int n;
struct Point {
  int x, y;
  inline Point(int x = 0, int y = 0): x(x), y(y) {}
  inline bool operator<(const Point &o) const {
    return x != o.x ? x < o.x : y < o.y;
  }
};
struct Segment {
  Point s, t;
  inline Segment(Point s = Point(), Point t = Point()): s(s), t(t) {}
  inline double get(int x) const {
    if (s.x == t.x)
      return s.y;
    return s.y + (double)(t.y - s.y) / (t.x - s.x) * (x - s.x);
  }
  inline bool operator<(const Segment &o) const {
    int x = max(s.x, o.s.x);
    return get(x) < o.get(x);
  }
} a[N + 5];
vector<pair<Point, int>> p;
map<Segment, Point> vis;

int main() {
  //freopen("network.in", "r", stdin), freopen("network.out", "w", stdout);
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    scanf("%d%d%d%d", &a[i].s.x, &a[i].s.y, &a[i].t.x, &a[i].t.y);
    if (a[i].t < a[i].s)
      swap(a[i].s, a[i].t);
    p.emplace_back(a[i].s, i), p.emplace_back(a[i].t, i);
  }
  sort(p.begin(), p.end());
  vis.emplace(Segment(Point(-inf, -inf), Point(-inf, inf)), Point());
  for (int i = 0; i < p.size(); ++i) {
    Point x;
    int id;
    tie(x, id) = p[i];
    if (x < a[id].t) {
      auto it = --vis.emplace(a[id], x).first;
      if (i)
        printf("%d %d %d %d\n", it->second.x, it->second.y, x.x, x.y);
      it->second = x;
    } else {
      auto it = vis.find(a[id]);
      prev(it)->second = x;
      vis.erase(it);
    }
  }
}