import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum N = 44100;
enum M = 1 << 15;
enum F = [261.6, 294.3, 327.0, 348.8, 392.4, 436.0, 490.5];

void main() {
  try {
    for (; ; ) {
      auto A = new real[N];
      foreach (i; 0 .. N) {
        A[i] = readReal / M;
      }
      
      real mn = real.infinity;
      int um = -1;
      foreach (u; 0 .. 7) {
        const d = cast(int)(round(N / F[u]));
        real sum = 0.0L;
        foreach (i; 0 .. N / 2) {
          sum += (A[i + d] - A[i])^^2;
        }
        debug {
          writeln(u, ": ", d, " ", sum);
        }
        if (chmin(mn, sum)) {
          um = u;
        }
      }
      
      writeln("CDEFGAB"[um], "4");
    }
  } catch (EOFException e) {
  }
}