#include <bits/stdc++.h>
using namespace std;
static const int INF = 500000000;
template <class T>
void debug(T a, T b) {
  for (; a != b; ++a) cerr << *a << ' ';
  cerr << endl;
}
int n;
pair<int, int> p[100005];
int assign[10];
int xzip[200005], yzip[200005];
int sum[200005], ysum[200005];
struct segtree {
  vector<int> val[800005];
  int n;
  void init(int n_, int n2) {
    n = 1;
    while (n < n_) n <<= 1;
    for (int i = 0; i < n2; ++i) val[p[i].first + n - 1].push_back(p[i].second);
    for (int i = 0; i < n_; ++i)
      sort((val[i + n - 1]).begin(), (val[i + n - 1]).end());
    for (int i = n - 2; i >= 0; --i) {
      val[i].resize(val[i * 2 + 1].size() + val[i * 2 + 2].size());
      merge((val[i * 2 + 1]).begin(), (val[i * 2 + 1]).end(),
            (val[i * 2 + 2]).begin(), (val[i * 2 + 2]).end(), val[i].begin());
    }
  }
  int query(int a, int b, int i, int l, int r, int lb, int ub) {
    if (a <= l && r <= b)
      return upper_bound((val[i]).begin(), (val[i]).end(), ub) -
             lower_bound((val[i]).begin(), (val[i]).end(), lb);
    if (b <= l || r <= a) return 0;
    int md = (l + r) >> 1;
    return query(a, b, i * 2 + 1, l, md, lb, ub) +
           query(a, b, i * 2 + 2, md, r, lb, ub);
  }
};
segtree seg;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d%d", &p[i].first, &p[i].second);
  for (int i = 0; i < 9; ++i) cin >> assign[i];
  for (int i = 0; i < n; ++i) {
    xzip[i] = p[i].first;
    yzip[i] = p[i].second;
  }
  sort(xzip, xzip + n);
  sort(yzip, yzip + n);
  int xn = unique(xzip, xzip + n) - xzip, yn = unique(yzip, yzip + n) - yzip;
  for (int i = 0; i < n; ++i) {
    p[i].first = lower_bound(xzip, xzip + xn, p[i].first) - xzip;
    p[i].second = lower_bound(yzip, yzip + yn, p[i].second) - yzip;
    cerr << "p[i].sc"
         << " = " << (p[i].second) << endl;
    p[i].first *= 2;
    p[i].second *= 2;
  }
  xn *= 2;
  yn *= 2;
  sort(p, p + n);
  seg.init(xn, n);
  for (int i = 0; i < n; ++i) sum[p[i].first]++;
  for (int i = 0; i < xn; ++i) sum[i + 1] += sum[i];
  for (int i = 0; i < n; ++i) ++ysum[p[i].second];
  for (int i = 0; i < yn; ++i) ysum[i + 1] += ysum[i];
  sort(assign, assign + 9);
  int m = 0;
  do {
    int left = assign[0] + assign[1] + assign[2],
        mid = assign[3] + assign[4] + assign[5],
        bot = assign[0] + assign[3] + assign[6],
        midy = assign[1] + assign[4] + assign[7];
    int div1 = lower_bound(sum, sum + xn, left) - sum,
        div2 = lower_bound(sum, sum + xn, left + mid) - sum,
        div3 = lower_bound(ysum, ysum + yn, bot) - ysum,
        div4 = lower_bound(ysum, ysum + yn, bot + midy) - ysum;
    if (sum[div1] == left && sum[div2] == left + mid && ysum[div3] == bot &&
        ysum[div4] == bot + midy) {
      ++div1;
      ++div2;
      ++div3;
      ++div4;
      if (seg.query(0, div1, 0, 0, seg.n, 0, div3) == assign[0] &&
          seg.query(0, div1, 0, 0, seg.n, div4, yn) == assign[2] &&
          seg.query(div2, xn, 0, 0, seg.n, 0, div3) == assign[6] &&
          seg.query(div2, xn, 0, 0, seg.n, div4, yn) == assign[8]) {
        printf("%.10f %.10f\n%.10f %.10f\n",
               (xzip[div1 / 2] + xzip[div1 / 2 + 1]) / 2.0,
               (xzip[div2 / 2] + xzip[div2 / 2 + 1]) / 2.0,
               (yzip[div3 / 2] + yzip[div3 / 2 + 1]) / 2.0,
               (yzip[div4 / 2] + yzip[div4 / 2 + 1]) / 2.0);
        return 0;
      }
    }
  } while (next_permutation(assign, assign + 9));
  puts("-1");
  return 0;
}
