description: The Olympic Games have just started and Federico is eager to watch the marathon race.
  
  There will be n athletes, numbered from 1 to n, competing in the marathon, and all of them have taken part in 5 important marathons, numbered from 1 to 5, in the past. For each 1≤ i≤ n and 1≤ j≤ 5, Federico remembers that athlete i ranked r_{i,j}-th in marathon j (e.g., r_{2,4}=3 means that athlete 2 was third in marathon 4).
  
  Federico considers athlete x superior to athlete y if athlete x ranked better than athlete y in at least 3 past marathons, i.e., r_{x,j}<r_{y,j} for at least 3 distinct values of j.
  
  Federico believes that an athlete is likely to get the gold medal at the Olympics if he is superior to all other athletes.
  
  Find any athlete who is likely to get the gold medal (that is, an athlete who is superior to all other athletes), or determine that there is no such athlete.
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. Then t test cases follow.
  
  The first line of each test case contains a single integer n (1≤ n≤ 50 000) — the number of athletes.
  
  Then n lines follow, each describing the ranking positions of one athlete.
  
  The i-th of these lines contains the 5 integers r_{i,1},\,r_{i,2},\,r_{i,3},\,r_{i,4},  r_{i,5} (1≤ r_{i,j}≤ 50 000) — the ranking positions of athlete i in the past 5 marathons. It is guaranteed that, in each of the 5 past marathons, the n athletes have distinct ranking positions, i.e., for each 1≤ j≤ 5, the n values r_{1,j},  r_{2, j},  ...,  r_{n, j} are distinct.
  
  It is guaranteed that the sum of n over all test cases does not exceed 50 000.
  
  Output
  
  For each test case, print a single integer — the number of an athlete who is likely to get the gold medal (that is, an athlete who is superior to all other athletes). If there are no such athletes, print -1. If there is more than such one athlete, print any of them.
  
  Example
  
  Input
  
  
  4
  1
  50000 1 50000 50000 50000
  3
  10 10 20 30 30
  20 20 30 10 10
  30 30 10 20 20
  3
  1 1 1 1 1
  2 2 2 2 2
  3 3 3 3 3
  6
  9 5 3 7 1
  7 4 1 6 8
  5 6 7 3 2
  6 7 8 8 6
  4 2 2 4 5
  8 3 6 9 4
  
  
  Output
  
  
  1
  -1
  1
  5
  
  Note
  
  Explanation of the first test case: There is only one athlete, therefore he is superior to everyone else (since there is no one else), and thus he is likely to get the gold medal.
  
  Explanation of the second test case: There are n=3 athletes. 
  
    * Athlete 1 is superior to athlete 2. Indeed athlete 1 ranks better than athlete 2 in the marathons 1, 2 and 3. 
    * Athlete 2 is superior to athlete 3. Indeed athlete 2 ranks better than athlete 3 in the marathons 1, 2, 4 and 5. 
    * Athlete 3 is superior to athlete 1. Indeed athlete 3 ranks better than athlete 1 in the marathons 3, 4 and 5. 
  
  
  
  Explanation of the third test case: There are n=3 athletes. 
  
    * Athlete 1 is superior to athletes 2 and 3. Since he is superior to all other athletes, he is likely to get the gold medal. 
    * Athlete 2 is superior to athlete 3. 
    * Athlete 3 is not superior to any other athlete. 
  
  
  
  Explanation of the fourth test case: There are n=6 athletes. 
  
    * Athlete 1 is superior to athletes 3, 4, 6. 
    * Athlete 2 is superior to athletes 1, 4, 6. 
    * Athlete 3 is superior to athletes 2, 4, 6. 
    * Athlete 4 is not superior to any other athlete. 
    * Athlete 5 is superior to athletes 1, 2, 3, 4, 6. Since he is superior to all other athletes, he is likely to get the gold medal. 
    * Athlete 6 is only superior to athlete 4. 
solution: import static java.util.Arrays.asList;
  import static java.util.stream.Collectors.toList;
  
  import java.io.BufferedReader;
  import java.io.ByteArrayOutputStream;
  import java.io.Closeable;
  import java.io.IOException;
  import java.io.InputStream;
  import java.io.InputStreamReader;
  import java.io.PrintStream;
  import java.net.URISyntaxException;
  import java.nio.file.Files;
  import java.nio.file.Path;
  import java.nio.file.Paths;
  import java.util.List;
  import java.util.StringTokenizer;
  import java.util.function.Supplier;
  import java.util.stream.Stream;
  
  /**
   * B. Running for Gold
   * @see <a href="https://codeforces.com/contest/1552/problem/B">https://codeforces.com/contest/1552/problem/B</a>
   */
  public class Main {
  
      private final boolean sample;
      private final InputStream in;
      private final PrintStream out;
      
      public Main(
              final Boolean sample, final InputStream in, final PrintStream out) {
          this.sample = sample;
          this.in = in;
          this.out = out;
      }
      
      @SuppressWarnings("unused")
      private void log(final Supplier<Object> supplier) {
          if (!sample) {
              return;
          }
          System.out.println(supplier.get());
      }
      
      private int better(final int[][] r, final int a1, final int a2) {
          int better = 0;
          for (int m = 0; m < 5; m++) {
              if (r[a1][m] < r[a2][m]) {
                  better++;
                  if (better >= 3) {
                      return a1;
                  }
              }
          }
          return a2;
      }
      
      private Result<?> handleTestCase(final Integer i, final FastScanner sc) {
          final int n = sc.nextInt();
          final int[][] r = new int[n][5];
          for (int j = 0; j < n; j++) {
              for (int k = 0; k < 5; k++) {
                  r[j][k] = sc.nextInt();
              }
          }
          int best = 0;
          for (int j = 1; j < n; j++) {
              if (better(r, best, j) != best) {
                  best = j;
              }
          }
          int ans = best + 1;
          for (int j = 0; j < n; j++) {
              if (better(r, best, j) != best) {
                  ans = -1;
                  break;
              }
          }
          return new Result<>(i, List.of(ans));
      }
      
      public void solve() {
          try (final FastScanner sc = new FastScanner(this.in)) {
              final int numberOfTestCases = sc.nextInt();
              final List<Result<?>> results
                      = Stream.iterate(1, i -> i <= numberOfTestCases, i -> i + 1)
                              .map(i -> handleTestCase(i, sc))
                              .collect(toList());
              output(results);
          }
      }
  
      private void output(final List<Result<?>> results) {
          results.forEach(r -> {
              r.getValues().stream().map(Object::toString).forEach(this.out::println);
          });
      }
      
      public static void main(final String[] args) throws IOException, URISyntaxException {
          final boolean sample = isSample();
          final InputStream is;
          final PrintStream out;
          final ByteArrayOutputStream baos = new ByteArrayOutputStream();
          long timerStart = 0;
          if (sample) {
              is = Main.class.getResourceAsStream("sample.in");
              out = new PrintStream(baos, true);
              timerStart = System.nanoTime();
          } else {
              is = System.in;
              out = System.out;
          }
          
          new Main(sample, is, out).solve();
          
          out.flush();
          if (sample) {
              final long timeSpent = (System.nanoTime() - timerStart) / 1_000;
              final double time;
              final String unit;
              if (timeSpent < 1_000) {
                  time = timeSpent;
                  unit = "µs";
              } else if (timeSpent < 1_000_000) {
                  time = timeSpent / 1_000.0;
                  unit = "ms";
              } else {
                  time = timeSpent / 1_000_000.0;
                  unit = "s";
              }
              final Path path
                      = Paths.get(Main.class.getResource("sample.out").toURI());
              final List<String> expected = Files.readAllLines(path);
              final List<String> actual = asList(baos.toString().split("\\r?\\n"));
              if (!expected.equals(actual)) {
                  throw new AssertionError(String.format(
                          "Expected %s, got %s", expected, actual));
              }
              actual.forEach(System.out::println);
              System.out.println(String.format("took: %.3f %s", time, unit));
          }
      }
      
      private static boolean isSample() {
          try {
              return "sample".equals(System.getProperty("codeforces"));
          } catch (final SecurityException e) {
              return false;
          }
      }
      
      private static final class FastScanner implements Closeable {
          private final BufferedReader br;
          private StringTokenizer st;
          
          public FastScanner(final InputStream in) {
              this.br = new BufferedReader(new InputStreamReader(in));
              st = new StringTokenizer("");
          }
          
          public String next() {
              while (!st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (final IOException e) {
                      throw new RuntimeException(e);
                  }
              }
              return st.nextToken();
          }
      
          public int nextInt() {
              return Integer.parseInt(next());
          }
          
          @SuppressWarnings("unused")
          public long nextLong() {
              return Long.parseLong(next());
          }
  
          @Override
          public void close() {
              try {
                  this.br.close();
              } catch (final IOException e) {
                  // ignore
              }
          }
      }
      
      private static final class Result<T> {
          @SuppressWarnings("unused")
          private final int number;
          private final List<T> values;
          
          public Result(final int number, final List<T> values) {
              this.number = number;
              this.values = values;
          }
  
          public List<T> getValues() {
              return values;
          }
      }
  }
  