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 {
  long long x, y;
  vector<int> nums;
};
bool cmp(const point& a, const point& b) {
  if (a.x < b.x)
    return true;
  else if (a.x > b.x)
    return false;
  else
    return a.y < b.y;
}
point vect(point a, point b) {
  b.x -= a.x;
  b.y -= a.y;
  return b;
}
long long prod(const point& a, const point& b) { return a.x * b.y - a.y * b.x; }
vector<point> ans;
void alg(const vector<point>& v) {
  ans.push_back(v[0]);
  if (not(v[0].x == v[1].x and v[0].y == v[1].y)) ans.push_back(v[1]);
  for (long long i = 2; i < v.size(); ++i) {
    while (ans.size() > 1 and
           prod(vect(ans[ans.size() - 2], ans[ans.size() - 1]),
                vect(ans[ans.size() - 1], v[i])) > 0) {
      ans.pop_back();
    }
    ans.push_back(v[i]);
  }
}
vector<point> v;
vector<point> up, down;
map<int, map<int, int>> mapp;
int f(int x, int y) {
  if (mapp[x].find(y) != mapp[x].end()) {
    return mapp[x][y];
  }
  return -1;
}
int main() {
  long long n;
  cin >> n;
  long long maxx = -1;
  for (long long i = 0; i < n; ++i) {
    point p;
    cin >> p.x >> p.y;
    maxx = max(maxx, p.x);
    int res = f(p.x, p.y);
    if (res != -1) {
      v[res].nums.push_back(i + 1);
    } else {
      v.push_back(p);
      v.back().nums.push_back(i + 1);
      mapp[p.x][p.y] = v.size() - 1;
    }
  }
  point pp;
  pp.x = 0;
  pp.y = 0;
  v.push_back(pp);
  pp.x = maxx + 1;
  v.push_back(pp);
  sort(v.begin(), v.end(), cmp);
  auto vector1 = vect(v.front(), v.back());
  up.push_back(v.front());
  down.push_back(v.front());
  for (long long i = 1; i <= n + 1; ++i) {
    auto res = prod(vector1, vect(v.front(), v[i]));
    if (res > 0)
      up.push_back(v[i]);
    else if (res < 0)
      down.push_back(v[i]);
  }
  up.push_back(v.back());
  down.push_back(v.back());
  assert(down.size() == 2);
  alg(up);
  vector<int> out;
  for (auto i : ans) {
    for (auto j : i.nums) {
      out.push_back(j);
    }
  }
  sort(out.begin(), out.end());
  for (int i : out) cout << i << " ";
  return 0;
}
