// movie-weekend
// Kanstantsin Sokal
// AC

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 101;

int l[MAX_N];
int r[MAX_N];

void solve() {
  int n; cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> l[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> r[i];
  }

  int answer = 0;
  for (int i = 1; i < n; i++) {
    if (make_pair(l[answer] * r[answer], r[answer]) < make_pair(l[i] * r[i], r[i])) {
      answer = i;
    }
  }

  cout << answer + 1 << "\n";
}

int main() {
  int cases; cin >> cases;

  for (int i = 0; i < cases; i++) {
    solve();
  }

  return 0;
}