#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

const int MAXn = 100000;
int cnt[2][MAXn + 5][3];
string zz = "RSP";
int z(char c){
	return zz.find(c);
}
int main() {
	cin.tie(nullptr)->sync_with_stdio(false);

	auto solve = [&]() {
		string s[2];
		cin >> s[0] >> s[1];
		int n[2] = {s[0].size(), s[1].size()};
		int g = __gcd(n[0], n[1]);
		for (int b = 0; b < 2; b++){
			for (int i = 0; i < n[b]; i++){
				cnt[b][i % g][z(s[b][i])]++;
			}
		}

		i64 win = 0;
		for (int r = 0; r < g; r++){
			for (int i = 0; i < 3; i++) {
				win += 1ll * cnt[0][r][i] * cnt[1][r][(i + 1) % 3];
				win -= 1ll *cnt[0][r][i] * cnt[1][r][(i + 2) % 3];
			}
		}

		if (win == 0) cout << "Rowdark\n";
		else if (win > 0) cout << "TankEngineer\n";
		else cout << "AngryBacon\n";
	};

	solve();

	return 0;
}