#include <bits/stdc++.h>
using namespace std;
pair<int, int> gelas[1111];
int N, x, y, z;
int main() {
  scanf("%d", &N);
  for (x = 1; x <= N; x++) {
    scanf("%d", &y);
    gelas[x] = make_pair(y, x);
  }
  sort(gelas + 1, gelas + N + 1);
  if (gelas[1].first == gelas[N].first)
    printf("Exemplary pages.\n");
  else
    switch (N) {
      case (2):
        if ((gelas[2].first - gelas[1].first) & 1)
          printf("Unrecoverable configuration.\n");
        else
          printf("%d ml. from cup #%d to cup #%d.\n",
                 (gelas[2].first - gelas[1].first) / 2, gelas[1].second,
                 gelas[2].second);
        break;
      default:
        if ((gelas[2].first != gelas[N - 1].first) ||
            (gelas[N].first - gelas[N - 1].first !=
             gelas[2].first - gelas[1].first))
          printf("Unrecoverable configuration.\n");
        else
          printf("%d ml. from cup #%d to cup #%d.\n",
                 (gelas[2].first - gelas[1].first), gelas[1].second,
                 gelas[N].second);
    }
  return 0;
}
