#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
constexpr double EPS = 1e-8;
struct vector2 {
  double x, y;
  double len() const { return sqrt(x * x + y * y); }
};
istream &operator>>(istream &is, vector2 &u) { return is >> u.x >> u.y; }
ostream &operator<<(ostream &os, const vector2 &u) {
  return os << '(' << u.x << ", " << u.y << ')';
}
vector2 operator+(const vector2 &u, const vector2 &v) {
  return {u.x + v.x, u.y + v.y};
}
vector2 operator-(const vector2 &u, const vector2 &v) {
  return {u.x - v.x, u.y - v.y};
}
vector2 operator*(const vector2 &u, double k) { return {u.x * k, u.y * k}; }
double operator*(const vector2 &u, const vector2 &v) {
  return u.x * v.y - u.y * v.x;
}
bool operator<(const vector2 &u, const vector2 &v) {
  return u.x < v.x || (u.x == v.x && u.y < v.y);
}
vector2 inverse(const vector2 &u, const vector2 &o, double r) {
  double d = (u - o).len();
  return o + (u - o) * (r * r / (d * d));
}
constexpr int MAXN = 1e5 + 10;
int n, ord[MAXN], stk[MAXN * 2], tp;
bool can[MAXN];
vector2 pt[MAXN];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int cas;
  cin >> cas;
  while (cas--) {
    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> pt[i];
    for (int i = 2; i <= n; ++i) pt[i] = inverse(pt[i], pt[1], 1);
    iota(ord + 1, ord + n + 1, 1);
    sort(ord + 1, ord + n + 1, [](int x, int y) { return pt[x] < pt[y]; });
    stk[tp = 1] = ord[1];
    for (int i = 2, u; i <= n; ++i) {
      u = ord[i];
      while (tp > 1 &&
             (pt[stk[tp]] - pt[stk[tp - 1]]) * (pt[u] - pt[stk[tp]]) <= EPS) {
        --tp;
      }
      stk[++tp] = u;
    }
    for (int i = n - 1, tmp = tp, u; i >= 1; --i) {
      u = ord[i];
      while (tp > tmp &&
             (pt[stk[tp]] - pt[stk[tp - 1]]) * (pt[u] - pt[stk[tp]]) <= EPS) {
        --tp;
      }
      stk[++tp] = u;
    }
    fill(can + 1, can + n + 1, false);
    for (int i = 2; i <= tp; ++i) can[stk[i]] = true;
    cout << count(can + 2, can + n + 1, true) << " ";
    for (int i = 2; i <= n; ++i)
      if (can[i]) cout << i - 1 << " ";
    cout << "\n";
  }
  return 0;
}
/*
g++ I.cpp -o I -std=c++14 -O2 -Wall -Wextra -Wshadow -g
-fsanitize=address,undefined
*/
/*
1
4
1 0
3 1
3 -2
7 0
*/