#include <bits/stdc++.h>

char s[10][10];

void work() {
    for (int i = 1; i <= 5; i ++) scanf("%s", s[i] + 1);

    int cnt = 0, max_x = 0, max_y = 0, min_x = 6, min_y = 6;
    for (int i = 1; i <= 5; i ++)
        for (int j = 1; j <= 5; j ++)
            if (s[i][j] == 'o') {
                cnt ++;
                max_x = std::max(max_x, i);
                max_y = std::max(max_y, j);
                min_x = std::min(min_x, i);
                min_y = std::min(min_y, j);
            }
    
    if (cnt == 1) {
        puts("Away");
    } else if (cnt == 2) {
        puts("Far");
    } else if (cnt == 3) {
        puts("Away");
    } else {
        if ((max_x == min_x + 1 && max_y == min_y + 1)
         || (max_x == min_x && max_y == min_y + 3)
         || (max_x == min_x + 3 && max_y == min_y))
            puts("Away");
        else
            puts("Far");
    }
}

int main() {
    int T;
    scanf("%d", &T);
    
    while (T --)
        work();
    
    return 0;
}