#include <bits/stdc++.h>
#define LOG(FMT...) fprintf(stderr, FMT);
#define rep(i, j, k) for(int i = j; i <= k; ++ i)
#define per(i, j, k) for(int i = j; i >= k; -- i)
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
typedef long double db;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
mt19937 mt(std::chrono::system_clock::now().time_since_epoch().count());
uniform_int_distribution<ll> ran(0, 1ll << 62);
void ucin() { ios::sync_with_stdio(0); cin.tie(0); }
// uniform_real_distribution<double> dbran;
template<class T> inline void chkmax(T &x, const T &y) { if(x < y) x = y; }
template<class T> inline void chkmin(T &x, const T &y) { if(x > y) x = y; }
inline ll sqr(ll x) { return x * x; }
inline ll cub(ll x) { return x * x * x; }

const int N = 4e5 + 10;
const int mod = 1e9 + 7;
int n;

const db eps = 1e-12;
#define lt(x, y) ((x) < (y) - eps)
#define gt(x, y) ((x) > (y) + eps)
#define leq(x, y) ((x) <= (y) + eps)
#define geq(x, y) ((x) >= (y) - eps)
#define eq(x, y) (leq(x, y) && geq(x, y))
#define cross(u, v, w) ((v - u).det(w - u))
struct point {
  db x, y; int id;
  // void in() { scanf("%lf%lf", &x, &y); }
  // void out() { printf("(%.2f, %.2f)\n", x, y); }
  void in_int() { int a, b; scanf("%d%d", &a, &b); x = a; y = b; }
  db norm() { return sqrt(x * x + y * y); }
  db norm2() { return x * x + y * y; }
  point operator + (point b) { return (point) {x + b.x, y + b.y}; }
  point operator - (point b) { return (point) {x - b.x, y - b.y}; }
  point operator - () const { return (point) {-x, -y}; }
  db operator * (point b) { return x * b.x + y * b.y; }
  point operator * (db b) { return (point) {x * b, y * b}; }
  point operator / (db b) { return (point) {x / b, y / b}; }
  db det(point b) { return x * b.y - y * b.x; }
  bool operator < (point b) const { return lt(x, b.x) || (leq(x, b.x) && lt(y, b.y)); }
  bool operator == (point b) { return eq(x, b.x) && eq(y, b.y); }
} a[N];
void ConvexHull(vector<point> &ps, vector<point> &qs) {
  int n = ps.size();
  if(n <= 1) { qs = ps; return ; }
  sort(ps.begin(), ps.end());
  qs.resize(2 * n); int r = 0;
  rep(i, 0, n - 1) {
    while(r >= 2 && leq(cross(qs[r - 2], qs[r - 1], ps[i]), 0)) r --;
    qs[r ++] = ps[i];
  }
  int t = r;
  per(i, n - 2, 0) {
    while(r >= t + 1 && leq(cross(qs[r - 2], qs[r - 1], ps[i]), 0)) r --;
    qs[r ++] = ps[i];
  }
  qs.resize(r-1);
}
int main() {
  int test;
  scanf("%d", &test);
  rep(T, 1, test) {
    scanf("%d", &n);
    rep(i, 1, n) {
      a[i].in_int();
    }
    if(n == 2) {
      printf("1 1\n");
      continue ;
    }
    a[1].id = 1;
    rep(i, 2, n) {
      db z = (a[i] - a[1]).norm2();
      a[i] = a[1] + (a[i] - a[1]) / z * 1e5;
      a[i].id = i;
    }
    // printf("%.3f\n", (a[4]-a[3]).det(a[3]-a[2]));
    vector<point> ps, qs;
    rep(i, 1, n) ps.pb(a[i]);
    ConvexHull(ps, qs);
    vector<int> ans;
    for(int i = 0; i < int(qs.size()); i ++)
      if(qs[i].id != 1) ans.pb(qs[i].id-1);
    sort(ans.begin(), ans.end());
    printf("%d", int(ans.size()));
    for(int x : ans)
      printf(" %d", x);
    printf("\n");
  }
  return 0;
}