#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <iostream>
#include <math.h>
#include <assert.h>
#include <vector>
#include <queue>
#include <string>
#include <map>
#include <set>

using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-9;
static const double PI = acos(-1.0);

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, s, n) for (int i = (s); i < (int)(n); i++)
#define FOREQ(i, s, n) for (int i = (s); i <= (int)(n); i++)
#define FORIT(it, c) for (__typeof((c).begin())it = (c).begin(); it != (c).end(); it++)
#define MEMSET(v, h) memset((v), h, sizeof(v))

char str[10000];
int main() {
  int test;
  scanf("%d", &test);
  while (test--) {
    int cnt = -1;
    int v = 0;
    scanf("%s", str);
    int len = strlen(str);
    REP(i, len) {
      v += str[i] - '0';
      cnt++;
      if (v >= 10) {
        cnt++;
        v = v / 10 + v % 10;
      }
    }
    if (cnt % 2 == 0) {
      puts("Audrey wins.");
    } else {
      puts("Fabre wins.");
    }
  }
}