krsu 7488 (40 points)

/*
by: ! senb1
*/

#include <bits/stdc++.h>

#define ll long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define endl '\n'

using namespace std;

const int maxn = 256;

void solve() {
    int y1, z1, y2, z2, x3, y3, z3;
    cin >> y1 >> z1 >> y2 >> z2 >> x3 >> y3 >> z3;
    if (((y2 == 0 and z2 == 0) or (y1 == 0 and z1 == 0)) and x3 == 0) {
        cout << 'I' << endl;
        return;
    }
    if ((y2 == 0 and z2 == 0) or (y1 == 0 and z1 == 0)) {
        cout << 'V' << endl;
        return;
    }
    if ((y1 == 0 and y2 == 0) or (z1 == 0 and z2 == 0) or
        (z1 == -z2 and y1 == -y2)) {
        cout << 'T' << endl;
        return;
    }
    if (x3 == 0) {
        cout << "X" << endl;
        return;
    }

    cout << 'B' << endl;
}
/*
1000 1000 0 0 8 8 8
*/

int main() {
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}