#include <bits/stdc++.h>
using namespace std;
const int mxn = 1e5 + 5, mxm = 3e3 + 3;
int n, m;
int X[mxn], Y[mxn];
int hang[mxm][mxm], lie[mxm][mxm], s[mxm][mxm], l, x, y, t;
int main() {
  scanf("%d", &n);
  for (int k = 1; k <= n; ++k) {
    int x1919810, y1919810, x2, y2;
    scanf("%d%d%d%d", &x1919810, &y1919810, &x2, &y2);
    for (int i = x1919810 + 1; i <= x2; ++i)
      for (int j = y1919810 + 1; j <= y2; ++j) ++s[i][j];
    for (int i = y1919810 + 1; i <= y2; ++i)
      hang[x1919810 + 1][i] = hang[x2 + 1][i] = 1;
    for (int i = x1919810 + 1; i <= x2; ++i)
      lie[i][y1919810 + 1] = lie[i][y2 + 1] = 1;
    X[k] = x1919810 + 1;
    Y[k] = y1919810 + 1;
  }
  for (int i = 1; i <= 3001; ++i)
    for (int j = 1; j <= 3001; ++j) {
      hang[i][j] += hang[i][j - 1];
      lie[i][j] += lie[i - 1][j];
      s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
    }
  for (int i = 1; i <= n; ++i) {
    x = X[i], y = Y[i], t = 1;
    for (;;) {
      if (s[x][y] - s[X[i] - 1][y] - s[x][Y[i] - 1] + s[X[i] - 1][Y[i] - 1] !=
          t * t)
        break;
      if (lie[x][Y[i]] - lie[x - 1][Y[i]] == 0) break;
      if (hang[X[i]][y] - hang[X[i]][y - 1] == 0) break;
      if (hang[x + 1][y] - hang[x + 1][Y[i] - 1] == t and
          lie[x][y + 1] - lie[X[i] - 1][y + 1] == t) {
        int num = 0;
        for (int j = 1; j <= n; ++j)
          if (X[j] >= X[i] and X[j] <= x and Y[j] >= Y[i] and Y[j] <= y) ++num;
        printf("YES %d\n", num);
        for (int j = 1; j <= n; ++j)
          if (X[j] >= X[i] and X[j] <= x and Y[j] >= Y[i] and Y[j] <= y)
            printf("%d ", j);
        return 0;
      }
      t++;
      x++;
      y++;
    }
  }
  printf("NO\n");
}
