#include<bits/stdc++.h>
#define db double
#define LL long long
#define pb push_back
#define eb emplace_back
#define pli pair<LL,int>
#define pii pair<int,int>
#define fr first
#define sc second
#define mp make_pair
using namespace std;
const int dx[]={0,1,0,-1,1,1,-1,-1},
		  dy[]={1,0,-1,0,1,-1,1,-1};

int n;
void Norm(vector<pii> &vt)
{
	int x=5,y=5;
	for(auto [i,j]:vt) x=min(x,i),y=min(y,j);
	for(auto &[i,j]:vt) i-=x,j-=y;
}
void solve()
{
	string s[5];vector<pii> vt;
	for(int i=0;i<5;++i) cin>>s[i];
	for(int i=0;i<5;++i)
		for(int j=0;j<5;++j)
			if(s[i][j]=='o')
				vt.eb(i,j);
	if(vt.size()==1) return puts("Away"),void();
	if(vt.size()==2) return puts("Far"),void();
	if(vt.size()==3) return puts("Away"),void();
	sort(vt.begin(),vt.end());
	Norm(vt);
	int x=0,y=0;
	for(auto [i,j]:vt)
	{
		x=max(x,i+1);
		y=max(y,j+1);
	}
	if(x>y) swap(x,y);
	if(mp(x,y)==mp(1,4)||mp(x,y)==mp(2,2)) return puts("Away"),void();
	puts("Far");
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int TT=1;
	cin>>TT;
	for(;TT;--TT) solve();
	return 0;
}