#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<sstream>
#include<numeric>
#include<cassert>

#define f first
#define s second
#define mp make_pair

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define rep(i,s,n) for(int i=(s); i<(int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i=(c).begin(); i!=(c).end(); i++)
#define ALL(c) (c).begin(), (c).end()
#define IN(x,s,g) ((x) >= (s) && (x) < (g))
#define ISIN(x,y,w,h) (IN((x),0,(w)) && IN((y),0,(h)))
#define print(x) printf("%d\n",x)

using namespace std;

typedef unsigned int uint;
typedef long long ll;

const int _dx[] = {0,1,0,-1};
const int _dy[] = {-1,0,1,0};

int getInt(){
  int ret = 0,c;
  c = getchar();
  while(!isdigit(c)) c = getchar();
  while(isdigit(c)){
    ret *= 10;
    ret += c - '0';
    c = getchar();
  }
  return ret;
}

int main(){
  int n; cin >> n;
  while(n --> 0){
    string str;
    stack<int> q;
    int cnt = 0;
    cin >> str;

    FOR(it, str) q.push(*it - '0');

    while(q.size() > 1){
      int a = q.top(); q.pop();
      int b = q.top(); q.pop();

      int c = a + b;

      cnt++;

      if(c >= 10){
	q.push(c % 10);
	q.push(c / 10);
      }else{
	q.push(c);
      }
    }

    printf("%s wins.\n", cnt % 2 == 0 ? "Audrey" : "Fabre");
  }
  return 0;
}