#include <stdio.h>
#include <vector>
#include <algorithm>

using namespace std;

vector <int> u;

#define nm 50010

int v[nm], l[nm], i, sol, n;


void read()

{
	scanf("%d", &n);

    for (i=1; i<=n; ++i)
    	scanf("%d ", &v[i]);
}


void solve()

{
	u.clear();

    l[0] = 0;
    v[0] = 0;
    
    for (i=1; i<=n + 1; ++i)
    {
        if (v[i] == 0)
        {
            if (v[i-1] == 1)
            {
                u.push_back(l[i-1]);
            }
        }
    	else
        {
            if (v[i-1] == 1)
            	l[i] = l[i-1] + 1;
            else
            	l[i] = 1;
        }
    }

    sol = 0;
    
    for (i=0; i<u.size(); ++i)
    {
        if (u[i] % 3 != 0)
        {
//        	u[i] = 1;
            sol ++;
        }
    }

    if (sol % 2 == 0)
	{
    	sol = 0;
        for (i=0; i<u.size(); ++i)
        {
        	if (u[i] % 3 != 0)
            {
                if (u[i] > 3)
                	sol = 1;
            }
        }
    }
    else
    	sol = 1;
    

}


void write()

{
    if (sol == 1)
    {
        printf("Nargy\n");
    }
    else
    	printf("Fumeanu\n");
}


int main()

{
	freopen("bowling.in" ,"r", stdin);
    freopen("bowling.out","w",stdout);

    int t;

    scanf("%d", &t);

    for (; t>0; --t)
    {

    	read();
    	solve();
    	write();

    }

    fclose(stdin);
    fclose(stdout);

	return 0;
}