#include <bits/stdc++.h>
using namespace std;
namespace fastIO {
bool IOerror = 0;
inline char nc() {
  static char buf[100000], *p1 = buf + 100000, *pend = buf + 100000;
  if (p1 == pend) {
    p1 = buf;
    pend = buf + fread(buf, 1, 100000, stdin);
    if (pend == p1) {
      IOerror = 1;
      return -1;
    }
  }
  return *p1++;
}
inline bool blank(char ch) {
  return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
inline void read(int &x) {
  bool sign = 0;
  char ch = nc();
  x = 0;
  for (; blank(ch); ch = nc())
    ;
  if (IOerror) return;
  if (ch == '-') sign = 1, ch = nc();
  for (; ch >= '0' && ch <= '9'; ch = nc()) x = x * 10 + ch - '0';
  if (sign) x = -x;
}
inline void read(long long &x) {
  bool sign = 0;
  char ch = nc();
  x = 0;
  for (; blank(ch); ch = nc())
    ;
  if (IOerror) return;
  if (ch == '-') sign = 1, ch = nc();
  for (; ch >= '0' && ch <= '9'; ch = nc()) x = x * 10 + ch - '0';
  if (sign) x = -x;
}
inline void read(double &x) {
  bool sign = 0;
  char ch = nc();
  x = 0;
  for (; blank(ch); ch = nc())
    ;
  if (IOerror) return;
  if (ch == '-') sign = 1, ch = nc();
  for (; ch >= '0' && ch <= '9'; ch = nc()) x = x * 10 + ch - '0';
  if (ch == '.') {
    double tmp = 1;
    ch = nc();
    for (; ch >= '0' && ch <= '9'; ch = nc())
      tmp /= 10.0, x += tmp * (ch - '0');
  }
  if (sign) x = -x;
}
inline void read(char *s) {
  char ch = nc();
  for (; blank(ch); ch = nc())
    ;
  if (IOerror) return;
  for (; !blank(ch) && !IOerror; ch = nc()) *s++ = ch;
  *s = 0;
}
inline void read(char &c) {
  for (c = nc(); blank(c); c = nc())
    ;
  if (IOerror) {
    c = -1;
    return;
  }
}
inline void read1(int &x) {
  char ch;
  int bo = 0;
  x = 0;
  for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') bo = 1;
  for (; ch >= '0' && ch <= '9'; x = x * 10 + ch - '0', ch = getchar())
    ;
  if (bo) x = -x;
}
inline void read1(long long &x) {
  char ch;
  int bo = 0;
  x = 0;
  for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') bo = 1;
  for (; ch >= '0' && ch <= '9'; x = x * 10 + ch - '0', ch = getchar())
    ;
  if (bo) x = -x;
}
inline void read1(double &x) {
  char ch;
  int bo = 0;
  x = 0;
  for (ch = getchar(); ch < '0' || ch > '9'; ch = getchar())
    if (ch == '-') bo = 1;
  for (; ch >= '0' && ch <= '9'; x = x * 10 + ch - '0', ch = getchar())
    ;
  if (ch == '.') {
    double tmp = 1;
    for (ch = getchar(); ch >= '0' && ch <= '9';
         tmp /= 10.0, x += tmp * (ch - '0'), ch = getchar())
      ;
  }
  if (bo) x = -x;
}
inline void read1(char *s) {
  char ch = getchar();
  for (; blank(ch); ch = getchar())
    ;
  for (; !blank(ch); ch = getchar()) *s++ = ch;
  *s = 0;
}
inline void read1(char &c) {
  for (c = getchar(); blank(c); c = getchar())
    ;
}
inline void read2(int &x) { scanf("%d", &x); }
inline void read2(long long &x) { scanf("%lld", &x); }
inline void read2(double &x) { scanf("%lf", &x); }
inline void read2(char *s) { scanf("%s", s); }
inline void read2(char &c) { scanf(" %c", &c); }
inline void readln2(char *s) { gets(s); }
struct Ostream_fwrite {
  char *buf, *p1, *pend;
  Ostream_fwrite() {
    buf = new char[100000];
    p1 = buf;
    pend = buf + 100000;
  }
  void out(char ch) {
    if (p1 == pend) {
      fwrite(buf, 1, 100000, stdout);
      p1 = buf;
    }
    *p1++ = ch;
  }
  void print(int x) {
    static char s[15], *s1;
    s1 = s;
    if (!x) *s1++ = '0';
    if (x < 0) out('-'), x = -x;
    while (x) *s1++ = x % 10 + '0', x /= 10;
    while (s1-- != s) out(*s1);
  }
  void println(int x) {
    static char s[15], *s1;
    s1 = s;
    if (!x) *s1++ = '0';
    if (x < 0) out('-'), x = -x;
    while (x) *s1++ = x % 10 + '0', x /= 10;
    while (s1-- != s) out(*s1);
    out('\n');
  }
  void print(long long x) {
    static char s[25], *s1;
    s1 = s;
    if (!x) *s1++ = '0';
    if (x < 0) out('-'), x = -x;
    while (x) *s1++ = x % 10 + '0', x /= 10;
    while (s1-- != s) out(*s1);
  }
  void println(long long x) {
    static char s[25], *s1;
    s1 = s;
    if (!x) *s1++ = '0';
    if (x < 0) out('-'), x = -x;
    while (x) *s1++ = x % 10 + '0', x /= 10;
    while (s1-- != s) out(*s1);
    out('\n');
  }
  void print(double x, int y) {
    static long long mul[] = {1,
                              10,
                              100,
                              1000,
                              10000,
                              100000,
                              1000000,
                              10000000,
                              100000000,
                              1000000000,
                              10000000000LL,
                              100000000000LL,
                              1000000000000LL,
                              10000000000000LL,
                              100000000000000LL,
                              1000000000000000LL,
                              10000000000000000LL,
                              100000000000000000LL};
    if (x < -1e-12) out('-'), x = -x;
    x *= mul[y];
    long long x1 = (long long)floor(x);
    if (x - floor(x) >= 0.5) ++x1;
    long long x2 = x1 / mul[y], x3 = x1 - x2 * mul[y];
    print(x2);
    if (y > 0) {
      out('.');
      for (int i = 1; i < y && x3 * mul[i] < mul[y]; out('0'), ++i)
        ;
      print(x3);
    }
  }
  void println(double x, int y) {
    print(x, y);
    out('\n');
  }
  void print(char *s) {
    while (*s) out(*s++);
  }
  void println(char *s) {
    while (*s) out(*s++);
    out('\n');
  }
  void flush() {
    if (p1 != buf) {
      fwrite(buf, 1, p1 - buf, stdout);
      p1 = buf;
    }
  }
  ~Ostream_fwrite() { flush(); }
} Ostream;
inline void print(int x) { Ostream.print(x); }
inline void println(int x) { Ostream.println(x); }
inline void print(char x) { Ostream.out(x); }
inline void println(char x) {
  Ostream.out(x);
  Ostream.out('\n');
}
inline void print(long long x) { Ostream.print(x); }
inline void println(long long x) { Ostream.println(x); }
inline void print(double x, int y) { Ostream.print(x, y); }
inline void println(double x, int y) { Ostream.println(x, y); }
inline void print(char *s) { Ostream.print(s); }
inline void println(char *s) { Ostream.println(s); }
inline void println() { Ostream.out('\n'); }
inline void flush() { Ostream.flush(); }
char Out[100000], *o = Out;
inline void print1(int x) {
  static char buf[15];
  char *p1 = buf;
  if (!x) *p1++ = '0';
  if (x < 0) *o++ = '-', x = -x;
  while (x) *p1++ = x % 10 + '0', x /= 10;
  while (p1-- != buf) *o++ = *p1;
}
inline void println1(int x) {
  print1(x);
  *o++ = '\n';
}
inline void print1(long long x) {
  static char buf[25];
  char *p1 = buf;
  if (!x) *p1++ = '0';
  if (x < 0) *o++ = '-', x = -x;
  while (x) *p1++ = x % 10 + '0', x /= 10;
  while (p1-- != buf) *o++ = *p1;
}
inline void println1(long long x) {
  print1(x);
  *o++ = '\n';
}
inline void print1(char c) { *o++ = c; }
inline void println1(char c) {
  *o++ = c;
  *o++ = '\n';
}
inline void print1(char *s) {
  while (*s) *o++ = *s++;
}
inline void println1(char *s) {
  print1(s);
  *o++ = '\n';
}
inline void println1() { *o++ = '\n'; }
inline void flush1() {
  if (o != Out) {
    if (*(o - 1) == '\n') *--o = 0;
    puts(Out);
  }
}
struct puts_write {
  ~puts_write() { flush1(); }
} _puts;
inline void print2(int x) { printf("%d", x); }
inline void println2(int x) { printf("%d\n", x); }
inline void print2(char x) { printf("%c", x); }
inline void println2(char x) { printf("%c\n", x); }
inline void print2(long long x) { printf("%lld", x); }
inline void println2(long long x) {
  print2(x);
  printf("\n");
}
inline void println2() { printf("\n"); }
};  // namespace fastIO
using namespace fastIO;
int a[10], visit[10], n, C[4][4], sumx[4], t1, s = 0;
double X1, X2, Y1, Y2;
struct node {
  int x, y;
} A[100005], B[100005];
bool cmpx(const node &x, const node &y) { return x.x < y.x; }
bool cmpy(const node &x, const node &y) { return x.y < y.y; }
template <class T>
struct Vector {
  typedef T *it;
  it Mem, End, MemEnd;
  void Grow() {
    int s = MemEnd - Mem;
    it NewMem = new T[s * 2];
    memcpy(NewMem, Mem, sizeof(T) * s);
    delete[] Mem;
    Mem = NewMem;
    End = Mem + s;
    MemEnd = Mem + s * 2;
  }
  void Shrink() {
    int s = MemEnd - Mem, l = End - Mem;
    it NewMem = new T[s >> 1];
    memcpy(NewMem, Mem, sizeof(T) * (s >> 1));
    delete[] Mem;
    Mem = NewMem;
    End = Mem + l;
    MemEnd = Mem + (s >> 1);
  }
  Vector() {
    Mem = new T[1];
    End = Mem;
    MemEnd = Mem + 1;
  }
  void push_back(const T &x) {
    if (End == MemEnd) Grow();
    *(End++) = x;
  }
  void pop_back() {
    --End;
    if (End - Mem < (MemEnd - Mem) >> 2) Shrink();
  }
  it begin() { return Mem; }
  it end() { return End; }
  int size() { return End - Mem; }
  int capacity() { return MemEnd - Mem; }
  void resize(int _size) {
    while (size() < _size) Grow();
    End = Mem + _size;
  }
  void clear() { End = Mem; }
  T &operator[](int id) { return Mem[id]; }
};
Vector<int> V[4];
void dfsP(int x, int y) {
  if (x == 4) {
    for (int j = 1; j <= 2; ++j) {
      int l = -1000000005, r = 1000000005, ll, rr;
      for (int i = 1; i <= 3; ++i) {
        int cnt;
        if (j == 1)
          cnt = a[C[i][1]];
        else
          cnt = a[C[i][1]] + a[C[i][2]];
        ll = V[i][cnt], rr = V[i][cnt + 1];
        if (ll > l) l = ll;
        if (rr < r) r = rr;
      }
      if (l >= r) return;
      if (j == 1)
        Y1 = 0.5 * (l + r);
      else
        Y2 = 0.5 * (l + r);
    }
    {
      printf("%.3lf %.3lf %.3lf %.3lf\n", X1, X2, Y1, Y2);
      exit(0);
    }
    return;
  }
  for (int i = y; i <= 3; ++i) {
    int tmp = C[x][i];
    C[x][i] = C[x][y];
    C[x][y] = tmp;
    if (y < 3)
      dfsP(x, y + 1);
    else
      dfsP(x + 1, 1);
    tmp = C[x][i];
    C[x][i] = C[x][y];
    C[x][y] = tmp;
  }
}
void calc() {
  int x1 = A[sumx[1]].x, x2 = A[sumx[1] + sumx[2]].x;
  if (A[sumx[1]].x == A[sumx[1] + 1].x ||
      A[sumx[1] + sumx[2]].x == A[sumx[1] + sumx[2] + 1].x)
    return;
  X1 = 0.5 * (A[sumx[1]].x + A[sumx[1] + 1].x);
  X2 = 0.5 * (A[sumx[1] + sumx[2]].x + A[sumx[1] + sumx[2] + 1].x);
  for (int i = 1; i <= 3; ++i) V[i].clear(), V[i].push_back(-1000000005);
  for (int i = 1; i <= n; ++i) {
    int x = B[i].x, y = B[i].y;
    if (x <= x1)
      V[1].push_back(y);
    else if (x <= x2)
      V[2].push_back(y);
    else
      V[3].push_back(y);
  }
  dfsP(1, 1);
}
void dfsC(int x, int y, int lim) {
  if (x == 3) {
    int c1 = 0;
    for (int i = 1; i <= 9; ++i)
      if (!visit[i]) C[3][++c1] = i;
    for (int i = 1; i <= 3; ++i) {
      sumx[i] = 0;
      for (int j = 1; j <= 3; ++j) sumx[i] += a[C[i][j]];
    }
    calc();
    return;
  }
  for (int i = lim; i <= 9; ++i)
    if (!visit[i]) {
      visit[i] = 1;
      C[x][y] = i;
      if (y == 3)
        dfsC(x + 1, 1, 1);
      else
        dfsC(x, y + 1, i + 1);
      visit[i] = 0;
    }
}
int main() {
  t1 = clock();
  read(n);
  for (int i = 1; i <= n; ++i) read(A[i].x), read(A[i].y), B[i] = A[i];
  A[0].x = A[0].y = 1000000005 * 2;
  B[0] = B[n + 1] = A[n + 1] = A[0];
  sort(A + 1, A + 1 + n, cmpx);
  sort(B + 1, B + 1 + n, cmpy);
  for (int i = 1; i <= 9; ++i) read(a[i]);
  dfsC(1, 1, 1);
  puts("-1");
  return 0;
}
