#include<iostream>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<deque>
#include<cctype>
#include<string.h>
#include<math.h>
#include<time.h>
#include<random>
#include<stack>
#include<string>
//#include<bits/stdc++.h>
#include <unordered_map>
#define ll                               long long
#define lowbit(x) (x & -x)
#define endl "\n"//                           交互题记得删除
using namespace std;
mt19937 rnd(time(0));
const ll mod =2;
const ll p=rnd()%mod;
const ll maxn=5e5+15;
ll ksm(ll x, ll y)
{
	ll ans = 1;
	while (y)
	{
		if (y & 1)
		{
			ans = ans % mod * (x % mod) % mod;
		}
		x = x % mod * (x % mod) % mod;
		y >>= 1;
	}
	return ans % mod % mod;
}
ll gcd(ll x, ll y)
{
	if (y == 0)
		return x;
	else
		return gcd(y, x % y);
}
void fio()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
}
int main()
{
	fio();
	ll t;
	cin>>t;
	while(t--)
	{
		string f[500];
		ll ans=0;
		for(ll i=1;i<=5;i++)cin>>f[i],f[i]='0'+f[i];
		ll pd=0;
		for(ll i=1;i<=5;i++)
		{
			for(ll j=1;j<=5;j++)
			{
				ans+=(f[i][j]=='o');
				if(i>=2&&j>=2)
				{
					if(f[i][j]=='o'&&f[i-1][j]=='o'&&f[i][j-1]=='o'&&f[i-1][j-1]=='o')
					pd=1;
				}
				    if(j>=4)
					{
						if(f[i][j]=='o'&&f[i][j-1]=='o'&&f[i][j-2]=='o'&&f[i][j-3]=='o')
						pd=1;
					}
					if(i>=4)
					{
						if(f[i][j]=='o'&&f[i-1][j]=='o'&&f[i-2][j]=='o'&&f[i-3][j]=='o')
						pd=1;
					}
			}
		}
		if(ans==1)
		cout<<"Away"<<endl;
		else if(ans==2)
		cout<<"Far"<<endl;
		else if(ans==3)
		{
			cout<<"Away"<<endl;
		}
		else if(ans==4)
		{
			if(pd==1)
			cout<<"Away"<<endl;
			else
			cout<<"Far"<<endl;
		}
	}
}