#include using namespace std; using ll = long long; using VI = vector; using VVI = vector>; using VVVI = vector>>; using VL = vector; using VVL = vector>; using VVVL = vector>>; using VD = vector; using VVD = vector>; using VVVD = vector>>; using VB = vector; using VVB = vector>; using P = pair; using VP = vector

; #define REP(i, n) for (int i = 0; i < (int)(n); i++) #define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++) #define ALL(a) (a).begin(),(a).end() constexpr int INF = 1001001001; constexpr ll LINF = 1001001001001001001ll; constexpr int DX[] = {1, 0, -1, 0}; constexpr int DY[] = {0, 1, 0, -1}; template< typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); } template< typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); } const ll MOD = 1000000007; int main() { ios::sync_with_stdio(false); std::cin.tie(nullptr); int N; cin >> N; VI A(N); REP(i, N) cin >> A[i]; VL D(7, 0); double H[] = {261.6, 294.3, 327.0, 348.8, 392.4, 436.0, 490.5}; REP(i, 7) { int d = 44100 / H[i]; REP(j, H[i] - 1) { REP(k, d) { D[i] += abs(A[j * d + k] - A[j * d + k + d]); } } } ll mind = LINF, ans; REP(i, 7) { if (mind > D[i]) { mind = D[i]; ans = i; } } cout << "CDEFGAB"[ans] << "4\n"; }