Tavas is a cheerleader in the new sports competition named "Pashmaks".

<image>

This competition consists of two part: swimming and then running. People will immediately start running R meters after they finished swimming exactly S meters. A winner is a such person that nobody else finishes running before him/her (there may be more than one winner).

Before the match starts, Tavas knows that there are n competitors registered for the match. Also, he knows that i-th person's swimming speed is si meters per second and his/her running speed is ri meters per second. Unfortunately, he doesn't know the values of R and S, but he knows that they are real numbers greater than 0.

As a cheerleader, Tavas wants to know who to cheer up. So, he wants to know all people that might win. We consider a competitor might win if and only if there are some values of R and S such that with these values, (s)he will be a winner.

Tavas isn't really familiar with programming, so he asked you to help him.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 2 × 105).

The next n lines contain the details of competitors. i-th line contains two integers si and ri (1 ≤ si, ri ≤ 104).

Output

In the first and the only line of output, print a sequence of numbers of possible winners in increasing order.

Examples

Input

3
1 3
2 2
3 1


Output

1 2 3 


Input

3
1 2
1 1
2 1


Output

1 3 
5
10 50
10 50
10 50
10 50
10 50
 2
10000 10000
10000 10000
 3
10000 10000
10000 10000
10000 10000
 3
1000 3000
1500 1500
3000 1000
 43
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 1
1 1
 2
1 1
1 1
 44
78 52
75 16
70 7
75 16
54 2
70 7
54 2
70 7
54 2
70 7
54 2
54 2
70 7
70 7
54 2
70 7
75 16
70 7
54 2
54 2
54 2
54 2
54 2
54 2
75 16
70 7
70 7
54 2
70 7
75 16
54 2
75 16
75 16
54 2
54 2
70 7
70 7
75 16
70 7
70 7
70 7
75 16
75 16
54 2
 3
1000 3000
1499 1499
3000 1000
 5
50 50
49 50
50 49
49 49
50 1
 18
82 38
33 69
33 69
33 69
33 69
33 69
82 38
33 69
33 69
33 69
82 38
33 69
33 69
82 38
82 38
33 69
33 69
33 69
 1
10000 9999
 3
1000 3000
1501 1501
3000 1000
 2
1 2
2 1

1 2 3 4 5
 1 2
 1 2 3
 1 2 3
 1 3 16 24 29 31 32 37 41 42
 1
 1 2
 1
 1 3
 1
 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
 1
 1 2 3
 1 2 

#include <bits/stdc++.h>
using namespace std;
struct point {
  int x, y, id;
};
vector<point> px, py, tmp;
int n, mark[1111111];
bool cmp(const point &a, const point &b) {
  if (a.x != b.x) return a.x < b.x;
  return a.y < b.y;
}
void del() {
  tmp.clear();
  for (int i = 1; i < py.size(); i++)
    if (py[i].x != py[i - 1].x) {
      tmp.push_back(py[i - 1]);
    }
  tmp.push_back(py[py.size() - 1]);
  py.clear();
  for (int i = 0; i < tmp.size(); i++) {
    py.push_back(tmp[i]);
  }
}
void print(vector<point> p) {
  sort(p.begin(), p.end(), cmp);
  for (int i = 0; i < p.size(); i++) cout << p[i].id << ' ';
}
vector<point> solve(vector<point> p1, vector<point> p2, int dep) {
  if (p1.size() == 1) return p1;
  vector<point> tx1, ty1, tx2, ty2, ans1, ans2, tm;
  int mid = p1.size() / 2;
  for (int i = 0; i < mid; i++) {
    tx1.push_back(p1[i]);
    mark[tx1[i].id] = dep;
  }
  for (int i = mid; i < p1.size(); i++) tx2.push_back(p1[i]);
  for (int i = 0; i < p2.size(); i++) {
    if (mark[p2[i].id] == dep)
      ty1.push_back(p2[i]);
    else
      ty2.push_back(p2[i]);
  }
  ans1 = solve(tx1, ty1, dep * 2);
  ans2 = solve(tx2, ty2, dep * 2 + 1);
  int maxx = 0;
  for (int i = 0; i < ans2.size(); i++) maxx = max(maxx, ans2[i].y);
  for (int i = 0; i < ans1.size(); i++)
    if (ans1[i].y > maxx) ans2.push_back(ans1[i]);
  return ans2;
}
int main() {
  point p;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> p.x >> p.y;
    p.id = i;
    py.push_back(p);
  }
  sort(py.begin(), py.end(), cmp);
  del();
  for (int i = 0; i < py.size(); i++) swap(py[i].x, py[i].y);
  sort(py.begin(), py.end(), cmp);
  del();
  for (int i = 0; i < py.size(); i++) {
    px.push_back(py[i]);
    swap(px[i].x, px[i].y);
  }
  sort(px.begin(), px.end(), cmp);
  sort(py.begin(), py.end(), cmp);
  vector<point> ans = solve(px, py, 1);
  print(ans);
  return 0;
}
