#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}

int main(){
  string s;cin >> s;
  string t;
  rep(i,s.size()){
    if(s[i]=='.')continue;
    t+=s[i];
  }
  ll p=stoll(t);
  ll now=0;
  ll cnt=0;
  while(1){
    now+=p;
    cnt+=1;
    if(now%1000==0){
      now/=1000;
      if(now%2==cnt%2)cout << "A" <<" ";
      else if(cnt%2)cout << "B" <<" ";
      else cout << "C" <<" ";
      break;
    }
  }
  CST(10);
  ll ans=cnt-1+now-1;
  for(int t=1;t<=100000;t+=2){
    long double x=cnt*t;
    x/=(cnt+now);
    if(x>=cnt)break;
    ans++;
  }
  for(int t=-100001;t<=100000;t+=2){
    long double x=cnt*t;
    x/=(now-cnt);
    if(x<=0||cnt<=x)continue;
    ans++;
  }
  cout << ans <<endl;
}