#include<iostream>
#include<set>
#include<queue>
#include<map>
#include<cmath>
#include<string>
#include<vector>
#include<cstring>
#include<algorithm>
#include<unordered_map>

#define pb push_back
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(),(x).end()
#define _for(i, a) for(int i = 0; i < (a); ++i) 
#define _rep(i, a, b) for(int i = (a);i <= (b); ++i)
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define u1 (u<<1)
#define u2 (u<<1|1)
//#define endl '\n'
using namespace std;
typedef pair<int,int> PII;

const int INF=0x3f3f3f3f;
const int P=1e9+7;
const int N=1e6+20,M=2*N;
int n,m,k,q[N];
char g[20][20];
void solve(){
	int cnt=0;
	_rep(i,1,5)
		_rep(j,1,5)
		{
			cin>>g[i][j];
			if(g[i][j]=='o')cnt++;
		}
	bool bl=false;
	_rep(i,1,5)
		_rep(j,1,5)
			{
				if(g[i][j]=='o')
				{
					if(g[i][j+1]=='o'&&g[i][j+2]=='o'&&g[i][j+3]=='o')bl=true;
					if(g[i][j+1]=='o'&&g[i+1][j]=='o'&&g[i+1][j+1]=='o')bl=true;
					if(g[i+1][j]=='o'&&g[i+2][j]=='o'&&g[i+3][j]=='o')bl=true;
					break;
				}
			}
	if(cnt==2||(cnt==4&&!bl))cout<<"Far\n";
	else cout<<"Away\n";
}
signed main(){
	IOS;
	int T=1;
	cin>>T;
	_rep(i,1,T){
		solve();
	}
	return 0;
}