#include <algorithm>
#include <bitset>
using namespace std;

#define DIM 50005
#define LIM 71

bitset <DIM> viz;
int v[DIM];
int t,n;

void init ()
{
    int i,j;

    for (i=0; i<LIM; ++i)
    {
        viz.reset ();
        for (j=0; j<i; ++j)
            viz[v[j]^v[i-j-1]]=1;
        for (j=0; j<i-1; ++j)
            viz[v[j]^v[i-j-2]]=1;
        for (j=0; viz[j]; ++j);
            v[i]=j;
    }
    for (i=LIM; i<DIM; ++i)
        v[i]=v[71+(i-LIM)%12];
}

void solve ()
{
    int i,j,x,sum,nrc;

    scanf ("%d",&t);
    for (i=1; i<=t; ++i)
    {
        scanf ("%d",&n);
        sum=0; nrc=0;
        for (j=1; j<=n; ++j)
        {
            scanf ("%d",&x);
            if (!x)
            {
                sum^=v[nrc];
                nrc=0;
            }
            else
                ++nrc;
        }
        sum^=v[nrc];
        if (sum)
            printf ("Nargy\n");
        else
            printf ("Fumeanu\n");
    }
}

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

    init ();
    solve ();

    return 0;
}