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: 			/*
  			TO LEARN
  			1-segment trees
  			2-euler tour
  		
  			*/
  			/*
  			TO SOLVE 
  			uva 1103
  			codeforces 722 kavi on pairing duty
  			*/
  			/*
  			bit manipulation shit
  			1-Computer Systems: A Programmer's Perspective
  			2-hacker's delight
  			3-(02-03-bits-ints)
  			4-machine-basics
  			5-Bits Manipulation tutorialspoint
  			*/
  			/*
  			TO WATCH
  			1-what is bitmasking by kartik arora youtube
  			*/
  			            import java.util.*;
  					    import java.math.*;
  					    import java.io.*; 
  					    import java.util.stream.Collectors;
  
  					       public class A{
  					     
  					  static InputStream inputStream = System.in;
  			            static FastScanner scan=new FastScanner();
  					     public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
  static ArrayList<Integer>res=new ArrayList<Integer>();
  static void rec(int arr[],int i,int k,int sum)
  {
  	if(i==5)
  	{
  		if(k==3)
  			res.add(sum);
  		return ;
  	}
  	if(i==4&&k<2)
  		return ;
  	if(k==3){
  		res.add(sum);
  		return;
  	}
  	rec(arr,i+1,k+1,sum+arr[i]);
  	rec(arr,i+1,k,sum);
  }
  
  				public static void main(String[] args)  throws Exception 
  			      {
  				
  						///scan=new FastScanner("cownomics.in");
  					//out = new PrintWriter("cownomics.out");
  					 
  					 /*
  					 currently doing 
  					 1-digit dp
  					 2-ds like fenwick and interval tree and sparse table 
  					 */
  					 /*
  					 READING 
  					 1-Everything About Dynamic Programming codeforces
  					 2-DYNAMIC PROGRAMMING: FROM NOVICE TO ADVANCED topcoder
  					 3-Introduction to DP with Bitmasking codefoces
  					 4-Bit Manipulation hackerearth
  					 5-read more about mobious and inculsion-exclusion 
  					 */
  		
  
  
  
  					    int tt=1;
  					tt=scan.nextInt();
  					int T=tt;
  					
  
  				 outer:while(tt-->0)
  					    {
  			int n=scan.nextInt();
  			int arr[][]=new int[n][6];
  			for(int i=0;i<n;i++)
  			{
  				for(int j=0;j<5;j++)
  					arr[i][j]=scan.nextInt();
  				arr[i][5]=i;
  			}
  
  			//Arrays.sort(arr, (a,b)->Integer.compare(a[0], b[0]));
  					    	int idx=0;
  					    	for(int i=1;i<n;i++)
  					    	{
  					    		if(check(idx,i,arr))
  					    		{	
  					    		}
  					    		else idx=i;
  					    	}
  			boolean works=true;
  					    	for(int i=0;i<n;i++)
  					    	{
  					    		if(i!=idx)
  					    		{
  					    			if(!check(idx,i,arr)){
  					    				works=false;
  					    			}
  					    		}
  					    	}
  					    	if(works)
  					    		out.println(arr[idx][5]+1);
  					    	else out.println(-1);
  			}
  
  			   out.close();
  		}
  		  	 
  		  	 static boolean check(int i,int j,int arr[][])
  		  	 {
  		  	 	int cnt=0;
  		  	 	for(int k=0;k<5;k++)
  		  	 		if(arr[i][k]<arr[j][k])
  		  	 			cnt++;
  		  	 return cnt>=3;
  		  	 }
  			 		  
  					   
  					
  					static class special{
  						boolean bool;
  						int n;
  						//int id;
  						special(boolean bool,int n)
  						{
  							this.bool=bool;
  							this.n=n;
  						}
  						@Override
  						    public int hashCode() {
  					                int hash = 7;
  		    hash = 31 * hash + (int) n;
  		   
  		    return hash;
  					            }
  					              @Override
  					            public boolean equals(Object o){
  					                if (o == this) return true;
  					                if (o.getClass() != getClass()) return false;
  					                special t = (special)o;
  					                return t.bool == bool && t.n == n;
  					            }
  					}
  
  					   
  					     static long binexp(long a,long n)
  					    {
  					        if(n==0)
  					            return 1;
  					        long res=binexp(a,n/2);
  					        if(n%2==1)
  					            return res*res*a;
  					        else 
  					            return res*res;
  					    }
  					     
  					    static long powMod(long base, long exp, long mod) {
  					           if (base == 0 || base == 1) return base;
  					           if (exp == 0) return 1;
  					           if (exp == 1) return (base % mod+mod)%mod;
  					           long R = (powMod(base, exp/2, mod) % mod+mod)%mod;
  					           R *= R;
  					           R %= mod;
  					           if ((exp & 1) == 1) {
  					               return (base * R % mod+mod)%mod;
  					           }
  					           else return (R %mod+mod)%mod;
  					       }
  					    static double dis(double x1,double y1,double x2,double y2)
  					    {
  					        return Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
  					    }
  					    static long mod(long x,long y)
  					        {
  					            if(x<0)
  					                x=x+(-x/y+1)*y;
  					            return x%y;
  					        }
  					     public static  long pow(long b, long e) {
  					                long r = 1;
  					                while (e > 0) {
  					                    if (e % 2 == 1) r = r * b ;
  					                    b = b * b;
  					                    e >>= 1;
  					                }
  					                return r;
  					            }
  					    private static void sort(long[] arr) {
  					            List<Long> list = new ArrayList<>();
  					            for (long object : arr) list.add(object);
  					            Collections.sort(list);
  					        //Collections.reverse(list);
  					            for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);
  					        }
  					    private static void sort2(long[] arr) {
  					            List<Long> list = new ArrayList<>();
  					            for (Long object : arr) list.add(object);
  					            Collections.sort(list);
  					        Collections.reverse(list);
  					            for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);
  					        }
  					     static class FastScanner
  			{
  			    private int BS = 1 << 16;
  			    private char NC = (char) 0;
  			    private byte[] buf = new byte[BS];
  			    private int bId = 0, size = 0;
  			    private char c = NC;
  			    private double cnt = 1;
  			    private BufferedInputStream in;
  			 
  			    public FastScanner() {
  			        in = new BufferedInputStream(System.in, BS);
  			    }
  			 
  			    public FastScanner(String s) {
  			        try {
  			            in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
  			        } catch (Exception e) {
  			            in = new BufferedInputStream(System.in, BS);
  			        }
  			    }
  			 
  			    private char getChar() {
  			        while (bId == size) {
  			            try {
  			                size = in.read(buf);
  			            } catch (Exception e) {
  			                return NC;
  			            }
  			            if (size == -1) return NC;
  			            bId = 0;
  			        }
  			        return (char) buf[bId++];
  			    }
  			 
  			    public int nextInt() {
  			        return (int) nextLong();
  			    }
  			 
  			    public int[] nextInts(int N) {
  			        int[] res = new int[N];
  			        for (int i = 0; i < N; i++) {
  			            res[i] = (int) nextLong();
  			        }
  			        return res;
  			    }
  			 
  			    public long[] nextLongs(int N) {
  			        long[] res = new long[N];
  			        for (int i = 0; i < N; i++) {
  			            res[i] = nextLong();
  			        }
  			        return res;
  			    }
  			 
  			    public long nextLong() {
  			        cnt = 1;
  			        boolean neg = false;
  			        if (c == NC) c = getChar();
  			        for (; (c < '0' || c > '9'); c = getChar()) {
  			            if (c == '-') neg = true;
  			        }
  			        long res = 0;
  			        for (; c >= '0' && c <= '9'; c = getChar()) {
  			            res = (res << 3) + (res << 1) + c - '0';
  			            cnt *= 10;
  			        }
  			        return neg ? -res : res;
  			    }
  			 
  			    public double nextDouble() {
  			        double cur = nextLong();
  			        return c != '.' ? cur : cur + nextLong() / cnt;
  			    }
  			 
  			    public double[] nextDoubles(int N) {
  			        double[] res = new double[N];
  			        for (int i = 0; i < N; i++) {
  			            res[i] = nextDouble();
  			        }
  			        return res;
  			    }
  			 
  			    public String next() {
  			        StringBuilder res = new StringBuilder();
  			        while (c <= 32) c = getChar();
  			        while (c > 32) {
  			            res.append(c);
  			            c = getChar();
  			        }
  			        return res.toString();
  			    }
  			 
  			    public String nextLine() {
  			        StringBuilder res = new StringBuilder();
  			        while (c <= 32) c = getChar();
  			        while (c != '\n') {
  			            res.append(c);
  			            c = getChar();
  			        }
  			        return res.toString();
  			    }
  			 
  			    public boolean hasNext() {
  			        if (c > 32) return true;
  			        while (true) {
  			            c = getChar();
  			            if (c == NC) return false;
  			            else if (c > 32) return true;
  			        }
  			    }
  			}
  
  					     static class Pair implements Comparable<Pair>{
  					            public long x, y,z;
  					            public Pair(long x1, long y1,long z1) {
  					                x=x1;
  					                y=y1;
  					                z=z1;
  					            }
  					             public Pair(long x1, long y1) {
  					                x=x1;
  					                y=y1;
  					    
  					            }
  					            
  					            @Override
  					            public int hashCode() {
  					                return (int)(x + 31 * y);
  					            }
  					            public String toString() {
  					                return x + " " + y+" "+z;
  					            }
  					            @Override
  					            public boolean equals(Object o){
  					                if (o == this) return true;
  					                if (o.getClass() != getClass()) return false;
  					                Pair t = (Pair)o;
  					                return t.x == x && t.y == y&&t.z==z;
  					            }
  					    public int compareTo(Pair o)
  					    {
  					    	
  					    
  					    	return (int)((o.y-o.x)-(y-x));
  					     
  					        }
  					     
  					    }
  					    
  					    }
  
  					     
  