#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10, maxa = 1e9 + 7;
int n, t1, t2, t3, t4, a2[20], xl[maxn], yd[maxn];
vector<int> sg[maxn * 4], xy1, xy0;
vector<pair<int, int>> a;
void build(int l = 0, int r = n, int id = 1) {
  if (r - l != 1) {
    int mid = (l + r) / 2;
    build(l, mid, id * 2);
    build(mid, r, id * 2 + 1);
  }
  for (int i = l; i < r; i++) sg[id].push_back(a[i].second);
  sort(sg[id].begin(), sg[id].end());
}
int get(int s, int e, int k, int l = 0, int r = n, int id = 1) {
  if (s <= l && r <= e)
    return sg[id].size() -
           (upper_bound(sg[id].begin(), sg[id].end(), k) - sg[id].begin());
  if (s >= r || l >= e) return 0;
  int mid = (l + r) / 2;
  return get(s, e, k, l, mid, id * 2) + get(s, e, k, mid, r, id * 2 + 1);
}
int main() {
  cout << fixed;
  cin >> n;
  for (int i = 0, x, y; i < n; i++) {
    cin >> x >> y;
    a.push_back({x, y});
    xy0.push_back(x);
    xy1.push_back(y);
  }
  for (int i = 1; i <= 9; i++) cin >> a2[i];
  sort(xy0.begin(), xy0.end());
  sort(xy1.begin(), xy1.end());
  sort(a.begin(), a.end());
  sort(a2 + 1, a2 + 10);
  for (int i = 0; i < n; i++) {
    xy0[i] != xy0[i + 1] ? xl[i + 1] = i : xl[i + 1] = -1;
    xy1[i] != xy1[i + 1] ? yd[i + 1] = xy1[i] : yd[i + 1] = -maxa;
  }
  build();
  do {
    t1 = a2[1] + a2[2] + a2[3];
    t2 = a2[4] + a2[5] + a2[6];
    t3 = a2[1] + a2[4] + a2[7];
    t4 = a2[2] + a2[5] + a2[8];
    if (xl[t3] == -1 || xl[t3 + t4] == -1 || yd[n - t1] == -maxa ||
        yd[n - t1 - t2] == -maxa)
      continue;
    if (get(0, xl[t3] + 1, yd[n - t1]) == a2[1])
      if (get(0, xl[t3] + 1, yd[n - t1 - t2]) == a2[1] + a2[4])
        if (get(0, xl[t3 + t4] + 1, yd[n - t1]) == a2[1] + a2[2])
          if (get(0, xl[t3 + t4] + 1, yd[n - t1 - t2]) ==
              a2[1] + a2[2] + a2[4] + a2[5]) {
            cout << double(xy0[xl[t3]]) + 0.5 << ' '
                 << double(xy0[xl[t3 + t4]]) + 0.5 << endl;
            cout << double(yd[n - t1]) + 0.5 << ' '
                 << double(yd[n - t1 - t2]) + 0.5 << endl;
            return 0;
          }
  } while (next_permutation(a2 + 1, a2 + 10));
  cout << -1 << endl;
  return 0;
}
