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. 
        import java.io.*;
        import java.util.*;
        import java.math.*;
        import java.lang.*;
         
         
         
        public class B implements Runnable {
     
            
            public void run() {
               
                final InputReader sc = new InputReader(System.in);
                final PrintWriter out = new PrintWriter(System.out);
               
                int t=sc.nextInt();
                while(t--!=0)
                {
                    int n=sc.nextInt();
                    int a[]=new int[n];
                    int ones=0;
                    int index=0;
                    for(int i=0;i<n;i++)
                    {
                        a[i]=sc.nextInt();
                    }
                    for(int i=0;i<n;i++)
                    {
                        if(a[i]==1)
                        {
                            ones++;
                        }

                    }
                    if(ones==n)
                    {
                        if(n%2==0)
                        {
                            out.println("Second");
                        }
                        else
                        {
                            out.println("First");
                        }
                    }
                    else
                    {
                        for(int i=0;i<n;i++)
                        {
                            if(a[i]>1)
                            {
                                index=i;
                                break;
                            }

                        }
                        if(index%2==0)
                        {
                            out.println("First");
                        }
                        else
                        {
                            out.println("Second");
                        }

                    }



                }
                    
     
                    
     
               
     
                   
     
     
     
                out.close();
            
            
                
                
                }
         
        //========================================================
         
            static class Pair
            {
                int a,b;
                Pair(final int aa,final int bb)
                {
                    a=aa;
                    b=bb;
                }
            }
            
            static void sa(final int a[],final InputReader sc)
            {
                for(int i=0;i<a.length;i++)
                {
                    a[i]=sc.nextInt();
                }
                Arrays.sort(a);
            }
         
            static class InputReader {
                private final InputStream stream;
                private final byte[] buf = new byte[1024];
                private int curChar;
                private int numChars;
                private SpaceCharFilter filter;
                private final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
         
                public InputReader(final InputStream stream) {
                    this.stream = stream;
                }
               
                public int read() {
                    if (numChars==-1)
                        throw new InputMismatchException();
                   
                    if (curChar >= numChars) {
                        curChar = 0;
                        try {
                            numChars = stream.read(buf);
                        }
                        catch (final IOException e) {
                            throw new InputMismatchException();
                        }
                       
                        if(numChars <= 0)              
                            return -1;
                    }
                    return buf[curChar++];
                }
             
                public String nextLine() {
                    String str = "";
                    try {
                        str = br.readLine();
                    }
                    catch (final IOException e) {
                        e.printStackTrace();
                    }
                    return str;
                }
                public int nextInt() {
                    int c = read();
                   
                    while(isSpaceChar(c))
                        c = read();
                   
                    int sgn = 1;
                   
                    if (c == '-') {
                        sgn = -1;
                        c = read();
                    }
                   
                    int res = 0;
                    do {
                        if(c<'0'||c>'9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    while (!isSpaceChar(c));
                   
                    return res * sgn;
                }
               
                public long nextLong() {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    int sgn = 1;
                    if (c == '-') {
                        sgn = -1;
                        c = read();
                    }
                    long res = 0;
                   
                    do {
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    while (!isSpaceChar(c));
                        return res * sgn;
                }
               
                public double nextDouble() {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    int sgn = 1;
                    if (c == '-') {
                        sgn = -1;
                        c = read();
                    }
                    double res = 0;
                    while (!isSpaceChar(c) && c != '.') {
                        if (c == 'e' || c == 'E')
                            return res * Math.pow(10, nextInt());
                        if (c < '0' || c > '9')
                            throw new InputMismatchException();
                        res *= 10;
                        res += c - '0';
                        c = read();
                    }
                    if (c == '.') {
                        c = read();
                        double m = 1;
                        while (!isSpaceChar(c)) {
                            if (c == 'e' || c == 'E')
                                return res * Math.pow(10, nextInt());
                            if (c < '0' || c > '9')
                                throw new InputMismatchException();
                            m /= 10;
                            res += (c - '0') * m;
                            c = read();
                        }
                    }
                    return res * sgn;
                }
               
                public String readString() {
                    int c = read();
                    while (isSpaceChar(c))
                        c = read();
                    final StringBuilder res = new StringBuilder();
                    do {
                        res.appendCodePoint(c);
                        c = read();
                    }
                    while (!isSpaceChar(c));
                   
                    return res.toString();
                }
             
                public boolean isSpaceChar(final int c) {
                    if (filter != null)
                        return filter.isSpaceChar(c);
                    return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
                }
             
                public String next() {
                    return readString();
                }
               
                public interface SpaceCharFilter {
                    public boolean isSpaceChar(int ch);
                }
            }
         
            public static void main(final String args[]) throws Exception {
                new Thread(null, new B(),"Main",1<<27).start();
            }
        } 