#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=3010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

//gcd
ll gcd(ll a,ll b){
    if(b==0)return a;
    return gcd(b,a%b);
}

signed main(){
    string a;cin>>a;
    ll x=0,y=0;
    ll cnt=0;
    bool f=0;
    rep(i,a.size()){
        if(f==0){
            if(a[i]=='.'){
                x=cnt;
                cnt=0;
                f=1;
            }else{
                cnt*=10;
                cnt+=(a[i]-'0');
            }
        }else{
            cnt*=10;
            cnt+=(a[i]-'0');
        }
    }
    y=cnt;
    ll z;
    if(y==0)z=1;
    else{
        z=1000/gcd(y,1000);
    }
    ll q=z,w=(x*1000+y)*z/1000;
    ll ans=0;
    if((q+w)%2==0){
        cout<<"A ";
        ans++;
    }else if(w%2==1){
        cout<<"C ";
    }else{
        cout<<"B ";
    }
    if(q>w){
        ans+=q*2+w-3;
    }else if(q<w){
        ans+=w*2+q-3;
    }else{
        ans+=0;
    }
    cout<<ans<<endl;
}