#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PII;

void solve()
{
    char mp[5][5];
    int cnt = 0;
    for (int i = 0; i < 5; i ++ )
        for (int j = 0; j < 5; j ++ )
            cin >> mp[i][j], cnt += mp[i][j] == 'o';
    if (cnt == 1) puts("Away");
    else if (cnt == 2) puts("Far");
    else if (cnt == 3) puts("Away");
    else
    {
        for (int i = 0; i < 5; i ++ )
        {
            int tot = 0;
            for (int j = 0; j < 5; j ++ ) tot += mp[i][j] == 'o';
            if (tot == 4) return puts("Away"), void();
        }
        for (int j = 0; j < 5; j ++ )
        {
            int tot = 0;
            for (int i = 0; i < 5; i ++ ) tot += mp[i][j] == 'o';
            if (tot == 4) return puts("Away"), void();
        }
        for (int i = 0; i < 4; i ++ )
            for (int j = 0; j < 4; j ++ )
                if (mp[i][j] == 'o' && mp[i][j + 1] == 'o' && mp[i + 1][j] == 'o' && mp[i + 1][j + 1] == 'o')
                    return puts("Away"), void();
        puts("Far");
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T -- ) solve();
    return 0;
}
/*
.....
.....
..o..
.....
.....
*/