#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define int long long
typedef long long ll;
typedef pair<int,int> PII;
const int N=2e5+10,M=4e5+10,mod=1e18;

int T;
int n;
char a[7][7];

void solve()
{
	n=0;
	for(int i=0;i<5;i++)
		for(int j=0;j<5;j++)
		{
			cin>>a[i][j];
			if(a[i][j]=='o') n++;
		}
	int flag=0;
	for(int i=0;i<5;i++)
	{
		int cnt1=0,cnt2=0;
		for(int j=0;j<5;j++)
		{
			if(a[i][j]==a[i][j+1]&&a[i][j]==a[i+1][j]&&a[i][j]==a[i+1][j+1]&&a[i][j]=='o')
			{
				flag=1;
				break;
			}
			if(a[i][j]=='o') cnt1++;
			if(a[j][i]=='o') cnt2++;
		}
		if(cnt1==4||cnt2==4) flag=1;
		if(flag) break;
	}
	if(n==1||n==3) cout<<"Away"<<endl;
	else if(n==2) cout<<"Far"<<endl;
	else
	{
		if(flag) cout<<"Away"<<endl;
		else cout<<"Far"<<endl;
	}
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0); 
	cin>>T;
	while(T--)
	{
		solve();
	}
	return 0;
}