#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(0) cerr
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef int64_t ll;

template<class T>
struct Point {
	typedef Point P;
	T x, y;
	explicit Point(T x=0, T y=0) : x(x), y(y) {}
	bool operator<(P p) const { return tie(x,y) < tie(p.x,p.y); }
	bool operator==(P p) const { return tie(x,y)==tie(p.x,p.y); }
	P operator+(P p) const { return P(x+p.x, y+p.y); }
	P operator-(P p) const { return P(x-p.x, y-p.y); }
	P operator*(T d) const { return P(x*d, y*d); }
	P operator/(T d) const { return P(x/d, y/d); }
	T dot(P p) const { return x*p.x + y*p.y; }
	T cross(P p) const { return x*p.y - y*p.x; }
	T cross(P a, P b) const { return (a-*this).cross(b-*this); }
	T dist2() const { return x*x + y*y; }
	double dist() const { return sqrt((double)dist2()); }
	// angle to x-axis in interval [-pi, pi]
	double angle() const { return atan2(y, x); }
	P unit() const { return *this/dist(); } // makes dist()=1
	P perp() const { return P(-y, x); } // rotates +90 degrees
	P normal() const { return perp().unit(); }
	// returns point rotated 'a' radians ccw around the origin
	P rotate(double a) const {
		return P(x*cos(a)-y*sin(a),x*sin(a)+y*cos(a)); }
};
typedef Point<int> P;
typedef Point<ll> Pll;

Pll promote(P p) {
  return Pll(p.x, p.y);
}

template<class P>
int sideOf(const P& s, const P& e, const P& p) {
	auto a = (e-s).cross(p-s);
	return (a > 0) - (a < 0);
}

pair<P, int> l[800005]; // 2.4 M
P lhsq[300005]; // .3M
P rhsq[300005]; // .3M
int retq[300005]; // .3M
int n, nq;
int allx[1400005]; // 1.4M
int querybyrhs[300005];
int querybylhs[300005];
int numxs = 0;
P currhull[500005];
int getidx(const P p) {
  auto it = lower_bound(l, l + n, mp(p, 0));
  assert(it->f == p);
  return it->s;
} 
void work(const int lhs, const int rhs) {
  int hullsz = 0;
  auto append = [&](P cand, bool toright) {
    if(toright) {
      while(hullsz >= 2 && sideOf(promote(currhull[hullsz-2]), promote(currhull[hullsz-1]), promote(cand)) >= 0) {
        hullsz--;
      }
    }
    else {
      while(hullsz >= 2 && sideOf(promote(currhull[hullsz-2]), promote(currhull[hullsz-1]), promote(cand)) <= 0) {
        hullsz--;
      }
    }
    currhull[hullsz++] = cand;
  };
  int mid = (lhs+rhs)/2;
  // eval to right
  for(int i = mid+1; i <= rhs; i++) {
    int truex = allx[i];
    auto lidx = lb(l, l+n, mp(P(truex, 0), 0)) - l;
    if(lidx < n && l[lidx].f.x == truex) {
      // add to hull
      append(l[lidx].f, true);
    }
    else {
      // answer queries
      int qidx = -1;
      {
        int a = 0;
        int b = nq-1;
        while(a <= b) {
          int tmid = (a+b)/2;
          if(rhsq[querybyrhs[tmid]].x >= truex) {
            qidx = tmid;
            b = tmid-1;
          }
          else a = tmid+1;
        }
      }
      while(qidx >= 0 && qidx < nq) {
        int cand = querybyrhs[qidx++];
        if(rhsq[cand].x != truex) break;
        if(allx[lhs] <= lhsq[cand].x && lhsq[cand].x <= allx[mid]) {
          P lhsp = lhsq[cand];
          P rhsp = rhsq[cand];
          const ll A = lhsp.y - rhsp.y;
          const ll B = rhsp.x - lhsp.x;
          const ll C = lhsp.y * ll(rhsp.x - lhsp.x) - lhsp.x * ll(rhsp.y - lhsp.y);
          auto eval = [&](int idx) -> ll {
            return A * currhull[idx].x + B * currhull[idx].y;
          };
          int lhsi = 0;
          int rhsi = hullsz - 1;
          while(retq[cand] == -1 && lhsi <= rhsi) {
            int mid = (lhsi + rhsi) / 2;
            ll curr = eval(mid);
            if(curr >= C) {
              retq[cand] = getidx(currhull[mid]);
              break;
            }
            if(lhsi == rhsi) break;
            assert(mid+1 <= rhsi);
            ll curr2 = eval(mid+1);
            if(curr2 >= C) {
              retq[cand] = getidx(currhull[mid+1]);
              break;
            }
            if(curr > curr2) rhsi = mid-1;
            else lhsi = mid+2;
          }
        }
      }
    }
  }
  hullsz = 0;
  for(int i = mid; i >= lhs; i--) {
    int truex = allx[i];
    auto lidx = lb(l, l+n, mp(P(truex, 0), 0)) - l;
    if(lidx < n && l[lidx].f.x == truex) {
      // add to hull
      append(l[lidx].f, false);
    }
    else {
      // answer queries
      int qidx = -1;
      {
        int a = 0;
        int b = nq-1;
        while(a <= b) {
          int tmid = (a+b)/2;
          if(lhsq[querybylhs[tmid]].x >= truex) {
            qidx = tmid;
            b = tmid-1;
          }
          else a = tmid+1;
        }
      }
      while(qidx >= 0 && qidx < nq) {
        int cand = querybylhs[qidx++];
        if(lhsq[cand].x != truex) break;
        if(allx[mid+1] <= rhsq[cand].x && rhsq[cand].x <= allx[rhs]) {
          P lhsp = lhsq[cand];
          P rhsp = rhsq[cand];
          const ll A = lhsp.y - rhsp.y;
          const ll B = rhsp.x - lhsp.x;
          const ll C = lhsp.y * ll(rhsp.x - lhsp.x) - lhsp.x * ll(rhsp.y - lhsp.y);
          auto eval = [&](int idx) -> ll {
            return A * currhull[idx].x + B * currhull[idx].y;
          };
          int lhsi = 0;
          int rhsi = hullsz - 1;
          while(retq[cand] == -1 && lhsi <= rhsi) {
            int mid = (lhsi + rhsi) / 2;
            ll curr = eval(mid);
            if(curr >= C) {
              retq[cand] = getidx(currhull[mid]);
              break;
            }
            if(lhsi == rhsi) break;
            assert(mid+1 <= rhsi);
            ll curr2 = eval(mid+1);
            if(curr2 >= C) {
              retq[cand] = getidx(currhull[mid+1]);
              break;
            }
            if(curr > curr2) rhsi = mid-1;
            else lhsi = mid+2;
          }
        }
      }
    }
  }
}
void divconq(int lhs, int rhs) {
  if(lhs >= rhs) return;
  int mid = (lhs+rhs)/2;
  divconq(lhs, mid);
  work(lhs, rhs);
  divconq(mid+1, rhs);
}
void solve() {
  cin >> n;
  for(int i = 0; i < n; i++) {
    cin >> l[i].f.x >> l[i].f.y;
    l[i].s = i+1;
    allx[numxs++] = l[i].f.x;
  }
  sort(l, l + n);
  cin >> nq;
  for(int i = 0; i < nq; i++) {
    cin >> lhsq[i].x >> lhsq[i].y >> rhsq[i].x >> rhsq[i].y;
    if(rhsq[i] < lhsq[i]) swap(lhsq[i], rhsq[i]);
    allx[numxs++] = lhsq[i].x;
    allx[numxs++] = rhsq[i].x;
    retq[i] = -1;
  }
  sort(allx, allx + numxs);
  numxs = unique(allx, allx + numxs) - allx;
  iota(querybylhs, querybylhs + nq, 0);
  iota(querybyrhs, querybyrhs + nq, 0);
  sort(querybylhs, querybylhs + nq, [&](int a, int b) {
    return lhsq[a] < lhsq[b];
  });
  sort(querybyrhs, querybyrhs + nq, [&](int a, int b) {
    return rhsq[a] < rhsq[b];
  });
  divconq(0, numxs-1);
  for(int i = 0; i < nq; i++) cout << retq[i] << "\n";
}

// what would chika do
// are there edge cases (N=1?)
// are array sizes proper (scaled by proper constant, for example 2* for koosaga tree)
// integer overflow?
// DS reset properly between test cases
// are you doing geometry in floating points
// are you not using modint when you should

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}