#include <bits/stdc++.h>
using namespace std;
long long Set(long long N, long long pos) { return N = N | (1 << pos); }
long long reset(long long N, long long pos) { return N = N & ~(1 << pos); }
bool check(long long N, long long pos) { return (bool)(N & (1 << pos)); }
void CI(long long &_x) { scanf("%I64d", &_x); }
void CO(long long &_x) { cout << _x; }
template <typename T>
void getarray(T a[], long long n) {
  for (long long i = 0; i < n; i++) cin >> a[i];
}
template <typename T>
void prLLIarray(T a[], long long n) {
  for (long long i = 0; i < n - 1; i++) cout << a[i] << " ";
  cout << a[n - 1] << endl;
}
const double EPS = 1e-9;
const long long INF = 0x7f7f7f7f;
long long dr8[8] = {1, -1, 0, 0, 1, -1, -1, 1};
long long dc8[8] = {0, 0, -1, 1, 1, 1, -1, -1};
long long dr4[4] = {0, 0, 1, -1};
long long dc4[4] = {-1, 1, 0, 0};
long long kn8r[8] = {1, 2, 2, 1, -1, -2, -2, -1};
long long kn8c[8] = {2, 1, -1, -2, -2, -1, 1, 2};
vector<pair<long long, long long> > V;
long long dis2(pair<long long, long long> a, pair<long long, long long> b) {
  return ((a.first - b.first) * (a.first - b.first)) +
         ((a.second - b.second) * (a.second - b.second));
}
bool check_first(vector<long long> G) {
  pair<long long, long long> a, b, c, d;
  a = V[G[0]];
  b = V[G[1]];
  c = V[G[2]];
  d = V[G[3]];
  if ((dis2(a, b) == dis2(b, c)) && (dis2(b, c) == dis2(c, d)) &&
      (dis2(c, d) == dis2(d, a)) && (dis2(a, c) == dis2(b, d))) {
    return 1;
  }
  return 0;
}
bool check_second(vector<long long> G) {
  pair<long long, long long> a, b, c, d;
  a = V[G[0]];
  b = V[G[1]];
  c = V[G[2]];
  d = V[G[3]];
  if ((dis2(a, b) == dis2(c, d)) && (dis2(b, c) == dis2(d, a)) &&
      (dis2(a, c) == dis2(b, d))) {
    return 1;
  }
  return 0;
}
int main() {
  for (long long i = 0; i < 8; i++) {
    long long x, y;
    cin >> x >> y;
    V.push_back(make_pair(x, y));
  }
  long long lim = 1 << 8;
  lim--;
  for (long long i = 0; i <= lim; i++) {
    vector<long long> f, s;
    for (long long pos = 0; pos < 8; pos++) {
      if (check(i, pos))
        f.push_back(pos);
      else
        s.push_back(pos);
    }
    bool poss_f = 0, poss_s = 0;
    if (f.size() != 4) {
      continue;
    }
    sort(f.begin(), f.end());
    sort(s.begin(), s.end());
    bool found_1 = 0, found_2 = 0;
    do {
      if (check_first(f)) {
        found_1 = 1;
        break;
      }
    } while (next_permutation(f.begin(), f.end()));
    do {
      if (check_second(s)) {
        found_2 = 1;
      }
    } while (next_permutation(s.begin(), s.end()));
    if (found_1 && found_2) {
      puts("YES");
      for (long long j = 0; j < 4; j++) cout << f[j] + 1 << " ";
      puts("");
      for (long long j = 0; j < 4; j++) cout << s[j] + 1 << " ";
      return 0;
    }
  }
  puts("NO");
}
