#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <cmath>
#include <bitset>
#include <cassert>

using namespace std;
typedef long long ll;

void solve()
{
    string s, t;
    cin >> s >> t;
    for (int i = 0; i < 3; i ++) s += s;

    int j = 0;
    int m = t.size();
    int cnt0 = 0, cnt1 = 0;
    for (int i = 0; s[i]; i ++)
    {
        if ((s[i] == 'R' && t[j] == 'S') || (s[i] == 'S' && t[j] == 'P') || (s[i] == 'P' && t[j] == 'R')) cnt0 ++;
        else if ((t[j] == 'R' && s[i] == 'S') || (t[j] == 'S' && s[i] == 'P') || (t[j] == 'P' && s[i] == 'R')) cnt1 ++;
        j ++;
        j %= m;
    }

    if (cnt0 > cnt1) cout << "TankEngineer\n";
    else if (cnt0 < cnt1) cout << "AngryBacon\n";
    else cout << "Rowdark\n";
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int tt = 1;
    // cin >> tt;
    while (tt --)
    {
        solve();
    }
    return 0;
}