Problem: You are given n rectangles, labeled 1 through n. The corners of rectangles have integer coordinates and their edges are parallel to the Ox and Oy axes. The rectangles may touch each other, but they do not overlap (that is, there are no points that belong to the interior of more than one rectangle).

Your task is to determine if there's a non-empty subset of the rectangles that forms a square. That is, determine if there exists a subset of the rectangles and some square for which every point that belongs to the interior or the border of that square belongs to the interior or the border of at least one of the rectangles in the subset, and every point that belongs to the interior or the border of at least one rectangle in the subset belongs to the interior or the border of that square.

Input

First line contains a single integer n (1 ≤ n ≤ 105) — the number of rectangles. Each of the next n lines contains a description of a rectangle, with the i-th such line describing the rectangle labeled i. Each rectangle description consists of four integers: x1, y1, x2, y2 — coordinates of the bottom left and the top right corners (0 ≤ x1 < x2 ≤ 3000, 0 ≤ y1 < y2 ≤ 3000).

No two rectangles overlap (that is, there are no points that belong to the interior of more than one rectangle).

Output

If such a subset exists, print "YES" (without quotes) on the first line of the output file, followed by k, the number of rectangles in the subset. On the second line print k numbers — the labels of rectangles in the subset in any order. If more than one such subset exists, print any one. If no such subset exists, print "NO" (without quotes).

Examples

Input

9
0 0 1 9
1 0 9 1
1 8 9 9
8 1 9 8
2 2 3 6
3 2 7 3
2 6 7 7
5 3 7 6
3 3 5 6


Output

YES 5
5 6 7 8 9


Input

4
0 0 1 9
1 0 9 1
1 8 9 9
8 1 9 8


Output

NO

Note

The first test case looks as follows:

<image>

Note that rectangles 6, 8, and 9 form a square as well, and would be an acceptable answer.

The second test case looks as follows:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100010, MAXW = 3010;
int N;
int in[MAXW][MAXW];
int ps[MAXW][MAXW];
map<pair<int, int>, int> bl, tr, br, tl;
int t[MAXN], l[MAXN], b[MAXN], r[MAXN];
int up[MAXN], rig[MAXN], lef[MAXN], dow[MAXN];
void setup() {
  for (int i = 1; i < MAXW; i++) {
    for (int j = 1; j < MAXW; j++) {
      ps[i][j] = bool(in[i - 1][j - 1]) + ps[i - 1][j] + ps[i][j - 1] -
                 ps[i - 1][j - 1];
    }
  }
}
bool full(int x1, int y1, int x2, int y2) {
  return (ps[x2][y2] - ps[x1][y2] - ps[x2][y1] + ps[x1][y1] ==
          (x2 - x1) * (y2 - y1));
}
int find_up(int at) {
  if (up[at]) return up[at];
  pair<int, int> next = make_pair(l[at], t[at]);
  up[at] = t[at] - b[at];
  if (bl.count(next)) up[at] += find_up(bl[next]);
  return up[at];
}
int find_rig(int at) {
  if (rig[at]) return rig[at];
  pair<int, int> next = make_pair(r[at], b[at]);
  rig[at] = r[at] - l[at];
  if (bl.count(next)) rig[at] += find_rig(bl[next]);
  return rig[at];
}
int find_lef(int at) {
  if (lef[at]) return lef[at];
  pair<int, int> next = make_pair(l[at], t[at]);
  lef[at] = r[at] - l[at];
  if (tr.count(next)) lef[at] += find_lef(tr[next]);
  return lef[at];
}
int find_dow(int at) {
  if (dow[at]) return dow[at];
  pair<int, int> next = make_pair(r[at], b[at]);
  dow[at] = t[at] - b[at];
  if (tr.count(next)) dow[at] += find_dow(tr[next]);
  return dow[at];
}
struct pt {
  int x, y, i;
  bool st;
  pt() {}
  pt(int a, int b, int c, bool d) : x(a), y(b), i(c), st(d) {}
};
bool cmp(const pt &a, const pt &b) {
  if (a.x - a.y != b.x - b.y) return a.x - a.y < b.x - b.y;
  if (a.x != b.x) return a.x < b.x;
  return a.st < b.st;
}
int main() {
  cin >> N;
  for (int i = 0; i < N; i++) {
    int first, second, C, D;
    cin >> first >> second >> C >> D;
    for (int j = first; j < C; j++)
      for (int k = second; k < D; k++) {
        in[j][k] = i + 1;
      }
    bl[make_pair(first, second)] = i;
    br[make_pair(C, second)] = i;
    tr[make_pair(C, D)] = i;
    tl[make_pair(first, D)] = i;
    l[i] = first;
    b[i] = second;
    r[i] = C;
    t[i] = D;
  }
  setup();
  for (int i = 0; i < N; i++) {
    find_up(i);
    find_lef(i);
    find_rig(i);
    find_dow(i);
  }
  vector<pt> p;
  for (int i = 0; i < N; i++) p.push_back(pt(l[i], b[i], i, true));
  for (int i = 0; i < N; i++) p.push_back(pt(r[i], t[i], i, false));
  sort(p.begin(), p.end(), cmp);
  string ans = "NO";
  vector<pair<int, int> > S;
  for (int i = 0; i < p.size(); i++) {
    if (i > 0 && p[i].x - p[i].y != p[i - 1].x - p[i - 1].y) S.clear();
    if (p[i].st) {
      S.push_back(make_pair(p[i].x, min(up[p[i].i], rig[p[i].i])));
    } else {
      while (!S.empty() && S.back().first + S.back().second < p[i].x)
        S.pop_back();
      if (!S.empty() &&
          p[i].x - min(dow[p[i].i], lef[p[i].i]) <= S.back().first) {
        pair<int, int> bl(S.back().first, p[i].y - (p[i].x - S.back().first)),
            tr(p[i].x, p[i].y);
        if (!full(bl.first, bl.second, tr.first, tr.second)) continue;
        cout << "YES ";
        set<int> rects;
        for (int i = bl.first; i < tr.first; i++) {
          for (int j = bl.second; j < tr.second; j++) rects.insert(in[i][j]);
        }
        cout << rects.size() << '\n';
        for (set<int>::iterator it = rects.begin(); it != rects.end(); it++)
          cout << *it << ' ';
        cout << '\n';
        return 0;
      }
    }
  }
  cout << "NO\n";
  return 0;
}