#include <bits/stdc++.h>
const long long int inf = 1e15;
const int M = 1e9 + 7;
using namespace std;
pair<long long int, long long int> arr[10];
std::vector<int> v;
long long int dist(pair<long long int, long long int> a,
                   pair<long long int, long long int> b) {
  long long int temp = (a.first - b.first) * (a.first - b.first) +
                       (a.second - b.second) * (a.second - b.second);
  return temp;
}
bool is_orthogonal(pair<long long int, long long int> a,
                   pair<long long int, long long int> b,
                   pair<long long int, long long int> c) {
  return ((a.first - b.first) * (c.first - b.first) +
              (a.second - b.second) * (c.second - b.second) ==
          0);
}
bool is_rectangle(pair<long long int, long long int> a,
                  pair<long long int, long long int> b,
                  pair<long long int, long long int> c,
                  pair<long long int, long long int> d) {
  return is_orthogonal(a, b, c) && is_orthogonal(b, c, d) &&
         is_orthogonal(c, d, a);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long int x, y;
  for (int i = 1; i < 9; ++i) {
    cin >> x >> y;
    arr[i] = make_pair(x, y);
  }
  for (int i = 1; i <= 8; ++i) v.push_back(i);
  do {
    if (is_rectangle(arr[v[0]], arr[v[1]], arr[v[2]], arr[v[3]]) &&
        (dist(arr[v[0]], arr[v[1]]) == dist(arr[v[1]], arr[v[2]])) &&
        is_rectangle(arr[v[4]], arr[v[5]], arr[v[6]], arr[v[7]])) {
      cout << "YES\n";
      for (int i = 0; i < 4; ++i) cout << v[i] << " ";
      cout << endl;
      for (int i = 4; i < 8; ++i) cout << v[i] << " ";
      cout << endl;
      return 0;
    }
  } while (next_permutation(v.begin(), v.end()));
  cout << "NO\n";
  return 0;
}
