#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long gcd(long long a, long long b) {
	if (b == 0) return a;
	else return gcd(b, a%b);
}
long long lcm(long long x, long long y) {
	return x * y / gcd(x, y);
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string s; cin >> s;
	int x = 0;
	int y = 1000;
	rep(i, s.size()) {
		if ('.' == s[i])continue;
		x *= 10;
		x += s[i] - '0';
	}
	int g = gcd(x, y);
	x = x / g;
	y = y / g;
	//cout << x << " " << y << endl;
	char c;
	if (0 == x % 2) {
		if (0 == y % 2) c = 'A';
		else c = 'B';
	}
	else {
		if (0 == y % 2) c = 'C';
		else c = 'A';
	}
	long long ans = 0;
	ans += x - 1;
	ans += y - 1;
	{
		int l = 1;
		int r = x + y;
		if (0 == r % 2)r--;
		else r -= 2;
		//cout << l << " " << r << endl;
		ans += (r - l) / 2 + 1;
	}
	{
		if (x > y) {
			int l = 1;
			int r = x - y;
			if (0 == r % 2)r--;
			else r -= 2;
			//cout << l << " " << r << endl;
			ans += (r - l) / 2 + 1;
		}
		else if (x < y) {
			int l = 1;
			int r = y - x;
			if (0 == r % 2)r--;
			else r -= 2;
			//cout << l << " " << r << endl;
			ans += (r - l) / 2 + 1;
		}
		else {
			//nop
		}
	}
	cout << c << " " << ans << endl;
	return 0;
}