There are n piles of stones, where the i-th pile has a_i stones. Two people play a game, where they take alternating turns removing stones.

In a move, a player may remove a positive number of stones from the first non-empty pile (the pile with the minimal index, that has at least one stone). The first player who cannot make a move (because all piles are empty) loses the game. If both players play optimally, determine the winner of the game.

Input

The first line contains a single integer t (1≤ t≤ 1000) — the number of test cases. Next 2t lines contain descriptions of test cases.

The first line of each test case contains a single integer n (1≤ n≤ 10^5) — the number of piles.

The second line of each test case contains n integers a_1,…,a_n (1≤ a_i≤ 10^9) — a_i is equal to the number of stones in the i-th pile.

It is guaranteed that the sum of n for all test cases does not exceed 10^5.

Output

For each test case, if the player who makes the first move will win, output "First". Otherwise, output "Second".

Example

Input


7
3
2 5 4
8
1 1 1 1 1 1 1 1
6
1 2 3 4 5 6
6
1 1 2 1 2 2
1
1000000000
5
1 2 2 1 1
3
1 1 1


Output


First
Second
Second
First
First
Second
First

Note

In the first test case, the first player will win the game. His winning strategy is: 

  1. The first player should take the stones from the first pile. He will take 1 stone. The numbers of stones in piles will be [1, 5, 4]. 
  2. The second player should take the stones from the first pile. He will take 1 stone because he can't take any other number of stones. The numbers of stones in piles will be [0, 5, 4]. 
  3. The first player should take the stones from the second pile because the first pile is empty. He will take 4 stones. The numbers of stones in piles will be [0, 1, 4]. 
  4. The second player should take the stones from the second pile because the first pile is empty. He will take 1 stone because he can't take any other number of stones. The numbers of stones in piles will be [0, 0, 4]. 
  5. The first player should take the stones from the third pile because the first and second piles are empty. He will take 4 stones. The numbers of stones in piles will be [0, 0, 0]. 
  6. The second player will lose the game because all piles will be empty. 
//package sequentialNim;


import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
//import java.util.Arrays;
import java.util.InputMismatchException;


public class Main {
	static boolean hasMultipleTestCases = true;
    static final String newLine = "\n";

	public static void main(String[] args) {
		 InputReader in = new InputReader(System.in);
	     PrintWriter out = new PrintWriter(System.out);
	     StringBuilder sb = new StringBuilder();
	 
	     int testCases = 1;
	     if (hasMultipleTestCases) {
	         testCases = in.nextInt();
	     }
	     while(testCases -- >0) {
	    	 int n=in.nextInt();
	    	 int count=0;
	    	 long a[]=new long[n];
	         for(int i=0;i<n;i++)
	        	 a[i]=in.nextLong();
	         for(int i=0;i<n;i++) {
	        	 if(a[i]==1)
	        		 count++;
	        	 else
	        		 break;
	         }
	         if(count==0) {
	        	 sb.append("First\n");
	         }
	         else if(count==n) {
	        	 if(n%2 == 1)
	        		 sb.append("First\n");
	        	 else
	        		 sb.append("Second\n");
	         }
	         else {
	        	 if(count%2 != 0)
	        		 sb.append("Second\n");
	        	 else
	        		 sb.append("First\n");
	        		 
	         }

	     }
	     out.println(sb);
	     out.flush();
	}
	
	static class InputReader {
	    private final InputStream stream;
	    private final byte[] buf = new byte[8192];
	    private int curChar, snumChars;
	    private SpaceCharFilter filter;

	    public InputReader(InputStream stream) {
	        this.stream = stream;
	    }

	    public int snext() {
	        if (snumChars == -1) throw new InputMismatchException();
	        if (curChar >= snumChars) {
	            curChar = 0;
	            try {
	                snumChars = stream.read(buf);
	            } catch (IOException e) {
	                throw new InputMismatchException();
	            }
	            if (snumChars <= 0) return -1;
	        }
	        return buf[curChar++];
	    }

	    public int nextInt() {
	        int c = snext();
	        while (isSpaceChar(c)) {
	            c = snext();
	        }
	        int sgn = 1;
	        if (c == '-') {
	            sgn = -1;
	            c = snext();
	        }
	        int res = 0;
	        do {
	            if (c < '0' || c > '9') throw new InputMismatchException();
	            res *= 10;
	            res += c - '0';
	            c = snext();
	        } while (!isSpaceChar(c));
	        return res * sgn;
	    }

	    public long nextLong() {
	        int c = snext();
	        while (isSpaceChar(c)) {
	            c = snext();
	        }
	        int sgn = 1;
	        if (c == '-') {
	            sgn = -1;
	            c = snext();
	        }
	        long res = 0;
	        do {
	            if (c < '0' || c > '9') throw new InputMismatchException();
	            res *= 10;
	            res += c - '0';
	            c = snext();
	        } while (!isSpaceChar(c));
	        return res * sgn;
	    }

	    public int[] nextIntArray(int n) {
	        int a[] = new int[n];
	        for (int i = 0; i < n; i++) {
	            a[i] = nextInt();
	        }
	        return a;
	    }

	    public String readString() {
	        int c = snext();
	        while (isSpaceChar(c)) {
	            c = snext();
	        }
	        StringBuilder res = new StringBuilder();
	        do {
	            res.appendCodePoint(c);
	            c = snext();
	        } while (!isSpaceChar(c));
	        return res.toString();
	    }

	    public String nextLine() {
	        int c = snext();
	        while (isSpaceChar(c)) c = snext();
	        StringBuilder res = new StringBuilder();
	        do {
	            res.appendCodePoint(c);
	            c = snext();
	        } while (!isEndOfLine(c));
	        return res.toString();
	    }

	    public boolean isSpaceChar(int c) {
	        if (filter != null) return filter.isSpaceChar(c);
	        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	    }

	    private boolean isEndOfLine(int c) {
	        return c == '\n' || c == '\r' || c == -1;
	    }

	    public interface SpaceCharFilter {
	        boolean isSpaceChar(int ch);
	    }
	 }
	
}

