#include <bits/stdc++.h>
using namespace std;
int N;
int sx[100010], ex[100010];
int sy[100010], ey[100010];
int sum[3010][3010];
int rsum[3010][3010], rlen[3010][3010];
int csum[3010][3010], clen[3010][3010];
inline int get_sum(int x1, int y1, int x2, int y2) {
  return sum[x2][y2] - sum[x1 - 1][y2] - sum[x2][y1 - 1] + sum[x1 - 1][y1 - 1];
}
void EXIT(int lx, int ly, int ux, int uy) {
  vector<int> out;
  for (int i = 0; i < N; ++i)
    if (lx <= sx[i] && ex[i] <= ux && ly <= sy[i] && ey[i] <= uy)
      out.push_back(i + 1);
  printf("YES %d\n", ((int)(out).size()));
  for (int i = 0; i < ((int)(out).size()); ++i)
    printf("%d%c", out[i], (i + 1 == ((int)(out).size())) ? '\n' : ' ');
  exit(0);
}
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; ++i) {
    scanf("%d%d%d%d", &sx[i], &sy[i], &ex[i], &ey[i]);
    ++sx[i], ++sy[i];
    ++sx[i], ++sy[i];
    ++ex[i], ++ey[i];
  }
  for (int i = 0; i < N; ++i) {
    ++rsum[sx[i] - 1][sy[i] - 1], --rsum[sx[i] - 1][ey[i]];
    ++rsum[ex[i]][sy[i] - 1], --rsum[ex[i]][ey[i]];
    ++csum[sy[i] - 1][sx[i] - 1], --csum[sy[i] - 1][ex[i]];
    ++csum[ey[i]][sx[i] - 1], --csum[ey[i]][ex[i]];
    for (int x = sx[i]; x <= ex[i]; ++x)
      for (int y = sy[i]; y <= ey[i]; ++y) ++sum[x][y];
  }
  for (int i = 1; i < 3010; ++i)
    for (int j = 1; j < 3010; ++j)
      sum[i][j] += sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1];
  for (int x = 0; x < 3010; ++x) {
    int bal = 0;
    for (int y = 0; y < 3010; ++y) {
      bal += rsum[x][y];
      if (bal)
        rlen[x][y] = 1 + rlen[x][y - 1];
      else
        rlen[x][y] = 0;
    }
  }
  for (int y = 0; y < 3010; ++y) {
    int bal = 0;
    for (int x = 0; x < 3010; ++x) {
      bal += csum[y][x];
      if (bal)
        clen[y][x] = 1 + clen[y][x - 1];
      else
        clen[y][x] = 0;
    }
  }
  for (int i = 0; i < N; ++i) {
    int ux = ex[i], uy = ey[i];
    int MAXL = min(rlen[ux][uy - 1], clen[uy][ux - 1]);
    (MAXL) = min((MAXL), (min(ux, uy)));
    int lx = ux + 1, ly = uy + 1;
    for (int len = 0; len < MAXL; ++len) {
      --lx, --ly;
      if (sum[ux][uy] - sum[lx - 1][uy] - sum[ux][ly - 1] +
              sum[lx - 1][ly - 1] !=
          ((len + 1) * (len + 1)))
        continue;
      if (rlen[lx - 1][uy - 1] <= len) continue;
      if (clen[ly - 1][ux - 1] <= len) continue;
      EXIT(lx, ly, ux, uy);
    }
  }
  puts("NO");
  return 0;
}
