#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 15;
int n, xa, ya, xb, yb;
int xx[maxn], yy[maxn];
int s[3005][3005], row[3005][3005], col[3005][3005];
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d%d%d", &xa, &ya, &xb, &yb);
    xa++;
    ya++;
    xx[i] = xa;
    yy[i] = ya;
    for (int j = xa; j <= xb; j++)
      for (int k = ya; k <= yb; k++) s[j][k]++;
    for (int j = xa; j <= xb; j++) col[j][ya] = col[j][yb + 1] = 1;
    for (int j = ya; j <= yb; j++) row[xa][j] = row[xb + 1][j] = 1;
  }
  for (int i = 1; i <= 3002; i++)
    for (int j = 1; j <= 3002; j++) {
      s[i][j] += s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1];
      row[i][j] += row[i][j - 1];
      col[i][j] += col[i - 1][j];
    }
  for (int i = 1; i <= n; i++) {
    xa = xx[i], ya = yy[i];
    for (int r = 1; xa + r <= 3001 && ya + r <= 3001; r++) {
      xb = xa + r - 1, yb = ya + r - 1;
      if (s[xb][yb] - s[xb][ya - 1] - s[xa - 1][yb] + s[xa - 1][ya - 1] !=
          r * r)
        break;
      if (row[xa][yb] - row[xa][ya - 1] != r) break;
      if (col[xb][ya] - col[xa - 1][ya] != r) break;
      if (row[xb + 1][yb] - row[xb + 1][ya - 1] != r) continue;
      if (col[xb][yb + 1] - col[xa - 1][yb + 1] != r) continue;
      int sum = 0;
      for (int j = 1; j <= n; j++)
        if (xa <= xx[j] && xx[j] <= xb && ya <= yy[j] && yy[j] <= yb) sum++;
      printf("YES %d\n", sum);
      for (int j = 1; j <= n; j++)
        if (xa <= xx[j] && xx[j] <= xb && ya <= yy[j] && yy[j] <= yb) {
          sum--;
          if (sum > 0)
            printf("%d ", j);
          else
            printf("%d\n", j);
        }
      return 0;
    }
  }
  printf("NO\n");
  return 0;
}
