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>
struct D1 {
  D1(int _val, int _num) {
    val = _val;
    num = _num;
  }
  int val;
  int num;
};
const int N = 40000;
struct DATA {
  DATA() {
    max = -1;
    ok = false;
    nearMaxInd = N;
  }
  std::vector<D1> d;
  int max;
  bool ok;
  int nearMaxInd;
};
std::vector<DATA> vs(N);
std::pair<int, int> arr[200000];
int res[200000];
int n;
int main(int argc, char* argv[]) {
  std::cin >> n;
  for (int i = 0; i < n; i++) {
    int s, r;
    std::cin >> s >> r;
    s--;
    r--;
    vs[s].d.push_back(D1(r, i));
    vs[s].max = std::max(r, vs[s].max);
  }
  std::stack<int> st;
  int k = N - 1;
  while (k >= 0) {
    bool bad = false;
    while (!st.empty() && vs[st.top()].max <= vs[k].max) {
      if (vs[st.top()].max == vs[k].max) bad = true;
      st.pop();
    }
    if (st.empty() && !bad)
      vs[k].ok = true;
    else
      vs[k].ok = false;
    st.push(k);
    k--;
  }
  int size = 0;
  for (int s = 0; s != vs.size(); s++)
    if (vs[s].ok)
      for (int j = 0; j != vs[s].d.size(); j++) {
        if (vs[s].d[j].val == vs[s].max) res[size++] = vs[s].d[j].num;
      }
  std::sort(res, res + size);
  for (int i = 0; i < size; i++) std::cout << res[i] + 1 << " ";
  std::cin >> n;
  return 0;
}
