#include<bits/stdc++.h>
#define F(i,l,r) for(int i=(l),i##end=(r);i<=i##end;++i)
#define G(i,l,r) for(int i=(l),i##end=(r);i>=i##end;--i)
#define pii pair<int,int>
#define x first
#define y second
#define mp(x,y) make_pair(x,y)
#define ep emplace_back
using namespace std;
typedef long long ll;

int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n=5;
		char ch[5][5];
		F(i,0,n-1)cin>>ch[i];
		int cnt=0,o=0,o1=0;
		F(i,0,n-1)F(j,0,n-1)if(ch[i][j]=='o')cnt++,o|=1<<i,o1|=1<<j;
		if(cnt==1)cout<<"Away\n";
		else if(cnt==2)cout<<"Far\n";
		else if(cnt==3)cout<<"Away\n";
		else if(__builtin_popcount(o)*__builtin_popcount(o1)!=6)
		{
			cout<<"Away\n";
		}
		else cout<<"Far\n";
	}
	return 0;
}