#include<bits/stdc++.h>
#include<cmath>
#define ll long long
#define lll __int128
#define ull unsigned long long
#define N 200010
#define For(i,a,b) for(ll i=a;i<=b;++i)
#define Rof(i,a,b) for(ll i=a;i>=b;--i)
#define ls x<<1
#define rs x<<1|1
#define lson ls,l,mid
#define rson rs,mid+1,r 
#define pb push_back
#define mk make_pair
#define pque priority_queue
#define pii pair<ll,ll>

using namespace std;
bool st;
char s[5][5];
bool ed;

ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}


int main()
{
	//fprintf(stderr,"%.2lf",(double)(&ed-&st)/1024/1024);
	//freopen("print.in","r",stdin);
	//freopen("print.out","w",stdout);
	int T;
	cin>>T;
	while(T--){
		int cnt=0;
		For(i,0,4){
			For(j,0,4){
				cin>>s[i][j];
				cnt+=(s[i][j]=='o');
			}
		}
		if(cnt==1){
			printf("Away\n");
			continue;
		}
		int is=0;
		For(i,0,1){
			For(j,0,4){
				if(s[i][j]=='o' && s[i+1][j]=='o' && s[i+2][j]=='o' && s[i+3][j]=='o'){
					is=1;
				}
			}
		}
		For(i,0,4){
			For(j,0,1){
				if(s[i][j]=='o' && s[i][j+1]=='o' && s[i][j+2]=='o' && s[i][j+3]=='o'){
					is=1;
				}
			}
		}
		For(i,0,3){
			For(j,0,3){
				if(s[i][j]=='o' && s[i][j+1]=='o' && s[i+1][j]=='o' && s[i+1][j+1]=='o'){
					is=1;
				}
			}
		}
		if(cnt==3 || is) printf("Away\n");
		else printf("Far\n");
	} 
 	return 0;
}
/*

*/