#include <bits/stdc++.h>   using namespace std;   long long getLL() {     long long ret = 0;     char c;     while (1) {       c = getchar();       if (c >=  0  && c <=  9 ) break;     }     while (1) {       ret = ret * 10 + c -  0 ;       c = getchar();       if (c <  0  || c >  9 ) break;     }     return ret;   }   int getInt() {     int ret = 0;     char c;     while (1) {       c = getchar();       if (c >=  0  && c <=  9 ) break;     }     while (1) {       ret = ret * 10 + c -  0 ;       c = getchar();       if (c <  0  || c >  9 ) break;     }     return ret;   }   const double eps = 1e-10;   int dcmp(double x) { return (x < -eps) ? -1 : (x > eps); }   struct Point {     double x, y;     int who;     Point() {}     Point(double _x, double _y, int _who) : x(_x), y(_y), who(_who){};     bool operator<(const Point &b) const {       if (dcmp(x - b.x) == 0) return y < b.y;       return x < b.x;     }     Point operator-(const Point &b) const { return Point(x - b.x, y - b.y, 0); }     double operator*(const Point &b) const { return x * b.y - y * b.x; }   } A[1020304];   int n, Stack[1020304], can[1020304], sameas[1020304];   int main() {     cin >> n;     for (int i = 1; i <= n; ++i) {       double r, s;       scanf( %lf%lf , &r, &s);       A[i] = Point(10000.0 / r, 10000.0 / s, i);     }     sort(A + 1, A + n + 1);     int Top = 0;     vector<int> ans;     for (int i = 1; i <= n; ++i) {       if (i > 1 && dcmp(A[i].x - A[i - 1].x) == 0) continue;       while (Top > 1 &&              (dcmp((A[i] - A[Stack[Top]]) * (A[i] - A[Stack[Top - 1]])) > 0))         --Top;       Stack[++Top] = i;     }     for (int i = 1; i <= Top; ++i)       if (i == 1 || dcmp(A[Stack[i]].y - A[Stack[i - 1]].y) < 0)         can[Stack[i]] = true;     for (int i = 1; i <= n; ++i) {       if (dcmp(A[i].x - A[i - 1].x) == 0 && dcmp(A[i].y - A[i - 1].y) == 0)         can[i] |= can[i - 1];       if (can[i]) ans.push_back(A[i].who);     }     sort(ans.begin(), ans.end());     for (auto x : ans) printf( %d  , x);     puts(  );     return 0;   }   