#include <bits/stdc++.h> #define ll long long using namespace std; int quihe(int n) { int sum = 0; while (n > 0) { sum += n % 10; n /= 10; } return sum; } int n; ll a[25]; int biange(int x) { x *= 7; while (x > 9) { x = quihe(x); } return x; } ll bian(ll x) { int i = 1; ll shuchu = 0; ll power = 1; while (x > 0) { if (i % 2 != 0) shuchu += power * biange(x % 10); else shuchu += power * (x % 10); x /= 10; i++; power *= 10; } return shuchu; } int main() { cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; ll ans = bian(a[i]); if (quihe(ans) % 8 == 0) cout << "T" << endl; else cout << "F" << endl; } return 0; }

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int quihe(int n) {
	int sum = 0;
	while (n > 0) {
		sum += n % 10;
		n /= 10;
	}
	return sum;
}
int n;
ll a[25];
int biange(int x) {
	x *= 7;
	while (x > 9) {
		x = quihe(x);
	}
	return x;
}
ll bian(ll x) {
	int i = 1;
	ll shuchu = 0;
	ll power = 1;
	while (x > 0) {
		if (i % 2 != 0)
			shuchu += power * biange(x % 10);
		else
			shuchu += power * (x % 10);
		x /= 10;
		i++;
		power *= 10;
	}
	return shuchu;
}
int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		ll	ans = bian(a[i]);
		if (quihe(ans) % 8 == 0)
			cout << "T" << endl;
		else
			cout << "F" << endl;
	}
	return 0;
}