#include <bits/stdc++.h>
long long dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
long long dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
 public:
  long long x;
  long long y, z;
  pa3(long long x = 0, long long y = 0, long long z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  long long x;
  long long y, z, w;
  pa4(long long x = 0, long long y = 0, long long z = 0, long long w = 0)
      : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  long long x, y;
  pa2(long long x = 0, long long y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
string itos(long long i) {
  ostringstream s;
  s << i;
  return s.str();
}
long long gcd(long long v, long long b) {
  if (v > b) return gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return gcd(v, b % v);
}
long long mod;
long long extgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pair<long long, long long> operator+(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first + r.first, l.second + r.second};
}
pair<long long, long long> operator-(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first - r.first, l.second - r.second};
}
long long pr[200010];
long long inv[200010];
long long beki(long long wa, long long rr, long long warukazu) {
  if (rr == 0) return 1 % warukazu;
  if (rr == 1) return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((long long)beki(wa, rr - 1, warukazu) * (long long)wa) % warukazu;
  long long zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
long long comb(long long nn, long long rr) {
  if (rr < 0 || rr > nn || nn < 0) return 0;
  long long r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}
void gya(long long ert) {
  pr[0] = 1;
  for (long long i = 1; i <= ert; i++) {
    pr[i] = (pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (long long i = ert - 1; i >= 0; i--) {
    inv[i] = inv[i + 1] * (i + 1) % mod;
  }
}
vector<pair<long long, long long> > VE;
vector<long long> ve;
long long D = 550;
bool hikaku(pa3 x, pa3 y) {
  long long xx = x.x / D;
  long long yy = y.x / D;
  if (xx != yy) return xx < yy;
  if (xx % 2 == 0)
    return x.y < y.y;
  else
    return !(x.y < y.y);
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  vector<pair<long long, long long> > han(n);
  set<pair<long long, long long> > se;
  map<pair<long long, long long>, long long> ma;
  for (long long i = 0; i < n; i++) {
    long long w;
    han[i].first = VE.size();
    cin >> w;
    vector<pair<long long, long long> > W(w);
    for (long long j = 0; j < w; j++) {
      cin >> W[j].first >> W[j].second;
    }
    for (long long j = 0; j < w; j++) {
      long long dx = W[(j + 1) % w].first - W[j].first;
      long long dy = W[(j + 1) % w].second - W[j].second;
      if (dx == 0) {
        if (dy > 0)
          dy = 1;
        else
          dy = -1;
      } else if (dy == 0) {
        if (dx > 0)
          dx = 1;
        else
          dx = -1;
      } else {
        long long g = gcd(abs(dx), abs(dy));
        dx /= g;
        dy /= g;
      }
      VE.push_back(make_pair(dx, dy));
      se.insert(make_pair(dx, dy));
    }
    han[i].second = VE.size();
  }
  long long cnt = 0;
  for (auto it = se.begin(); it != se.end(); it++) {
    ma[*it] = cnt;
    cnt++;
  }
  for (long long i = 0; i < VE.size(); i++) {
    ve.push_back(ma[VE[i]]);
  }
  long long Q;
  cin >> Q;
  vector<pa3> que;
  for (long long i = 0; i < Q; i++) {
    long long x, y;
    cin >> x >> y;
    x--, y--;
    long long l = han[x].first;
    long long r = han[y].second;
    que.push_back((pa3){l, r - 1, i});
  }
  sort(que.begin(), que.end(), hikaku);
  long long l = 0, r = -1;
  vector<long long> ans(Q);
  vector<long long> me(300020, 0);
  cnt = 0;
  for (auto v : que) {
    while (r < v.y) {
      r++;
      me[ve[r]]++;
      if (me[ve[r]] == 1) cnt++;
    }
    while (l > v.x) {
      l--;
      me[ve[l]]++;
      if (me[ve[l]] == 1) cnt++;
    }
    while (r > v.y) {
      me[ve[r]]--;
      if (me[ve[r]] == 0) cnt--;
      r--;
    }
    while (l < v.x) {
      me[ve[l]]--;
      if (me[ve[l]] == 0) cnt--;
      l++;
    }
    ans[v.z] = cnt;
  }
  for (auto v : ans) cout << v << endl;
  return 0;
}
