include <bits/stdc++.h>

using namespace std;
int A[55],B[55],n;
bool vis[55];
bool dfs(int pos_a,int pos_b,int cnt){
if(cnt==n/2)return true;
int pa = pos_a+1,pb = pos_b+1;
while(pa<=n&&vis[pa])pa++;
if(pa>n)return false;
vis[pa] = 1;
for(;pb<=n;pb++){
if(vis[pb])continue;
if(A[pb]==A[pa]){
vis[pb] = 1;
if(dfs(pa,pb,cnt+1))return true;
vis[pb] = 0;
}
}
vis[pa] = 0;
return false;
}
int main()
{int T;
scanf("%d",&T);
while(T--){
scanf("%d",&n);
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++)scanf("%d",&A[i]),B[i]=A[i];
sort(B+1,B+1+n);
int m = unique(B+1,B+1+n)-B-1;
for(int i=1;i<=n;i++)A[i] = lower_bound(B+1,B+1+m,A[i])-B;
bool flag = 0;
for(int i=2;i<=n;i++){
if(A[i]==A[1]&&!flag){
memset(vis,0,sizeof(vis));
vis[1] = 1;vis[i] = 1;
flag = dfs(1,i,1);
}
}
if(flag)printf("Frederica Bernkastel\n");
else printf("Furude Rika\n");
}
return 0;
}