/**
 * @author : cyb1010
 * @date   : 2023-10-17 09:04:56
 * @file   : game.cpp
 */
#include <bits/stdc++.h>
using namespace std;
namespace FastIO {
const std::size_t buf_size = 1 << 18;
char I[buf_size], *p1, *p2, O[buf_size], s[128];
int p, q, f;
inline char gc() {
    return p1 == p2 && (p2 = (p1 = I) + fread(I, 1, sizeof(I), stdin), p1 == p2)
               ? EOF
               : *p1++;
}
inline void pc(char c) { O[p++] = c; }
inline void flush() { fwrite(O, 1, p, stdout), p = 0; }
void chkf() {
    if (p >= buf_size >> 1) flush();
}
struct AutoFlush {
    ~AutoFlush() { flush(); }
} auto_flush;

template <typename T>
void rd(T &x) {
    char c = gc();
    x = 0, f = c == '-';
    while (!isdigit(c)) c = gc(), c == '-' ? f = 1 : 0;
    while (isdigit(c)) x = x * 10 + c - '0', c = gc();
    f ? x = -x : 1;
}
template <typename T>
void wr(T x) {
    if (x < 0) x = -x, pc('-');
    do s[++q] = (x % 10) | 48;
    while (x /= 10);
    do pc(s[q]);
    while (--q);
    chkf();
}
template <typename T>
void wr(T x, char c) {
    wr(x), pc(c);
}
} // namespace FastIO
using FastIO::rd;
using FastIO::pc;
using FastIO::chkf;
#define fo(s) freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
#define fi first
#define se second
typedef double db;
typedef long double ldb;
typedef long long ll;
typedef unsigned long long ull;
int __, _, n, x, a[100010];
#define wrf pc('F'), pc('i'), pc('r'), pc('s'), pc('t'), pc('\n'), chkf()
#define wrs                                                                    \
    pc('S'), pc('e'), pc('c'), pc('o'), pc('n'), pc('d'), pc('\n'), chkf()
#define wrd pc('D'), pc('r'), pc('a'), pc('w'), pc('\n'), chkf()
bool chk_3() {
    for (int i = 2; i < n; i += 2)
        if (a[i] != a[i - 1]) return false;
    x = 0;
    for (int i = 2; i < n; i += 2) x ^= a[i];
    return (((x ^ a[n]) > x) ? (wrf) : (wrs)), true;
}
bool chk_t(int l, int r) {
    for (int i = l; i < r; i += 2)
        if (a[i] != a[i + 1]) return false;
    return true;
}
bool chk(int l, int r) {
    int x = l, y = 0;
    for (int i = l; i <= r; i++) y += a[i];
    if (y & 3) return false;
    while (a[l] == a[r] && l < r) l++, r--;
    return chk_t(l, r) || (x < l && chk_t(l - 1, r + 1));
}
void work() {
    rd(n), x = 0;
    for (int i = 1; i <= n; i++) rd(a[i]), x ^= a[i];
    if (!x) return wrd;
    if (!(n & 1)) return wrf;
    if (chk_3()) return;
    x = __lg(x);
    for (int i = 1; i <= n; i++) a[i] = (a[i] >> x) & 1;
    if (chk(1, n - 1) || chk(2, n)) return wrf;
    wrs;
}
int main() {
    // fo("game");
    rd(_);
    while (_--) work();
    return 0 ^ __ ^ 0;
}