#include <bits/stdc++.h>
using namespace std;
void read_file(bool outToFile = true) {}
vector<int> A, B;
bool byA(int l, int r) { return A[l] < A[r]; }
int main() {
  read_file();
  int n;
  while (cin >> n) {
    A.resize(n), B.resize(n);
    for (int i = 0; i < n; i++) cin >> A[i], B[i] = i;
    sort(((B).begin()), ((B).end()), byA);
    sort(((A).begin()), ((A).end()));
    for (int i = 0; i < n; i++) B[i]++;
    if (n == 1) {
      cout << "Exemplary pages." << '\n';
      continue;
    }
    if (n == 2) {
      if (A[0] == A[1]) {
        cout << "Exemplary pages." << '\n';
      } else if ((A[0] + A[1]) % 2 == 0) {
        printf("%d ml. from cup #%d to cup #%d.\n", (A[1] - A[0]) / 2, B[0],
               B[1]);
      } else {
        cout << "Unrecoverable configuration." << '\n';
      }
      continue;
    }
    bool ok = true;
    int val = A[1];
    for (int i = 1; i < n - 1; i++) ok &= val == A[i];
    if ((A[0] + A[n - 1]) % 2 != 0)
      ok = false;
    else if ((A[0] + A[n - 1]) / 2 != val)
      ok = false;
    if (!ok) {
      cout << "Unrecoverable configuration." << '\n';
      continue;
    }
    if (A[0] == A[n - 1]) {
      cout << "Exemplary pages." << '\n';
      continue;
    }
    printf("%d ml. from cup #%d to cup #%d.\n", (A[n - 1] - A[0]) / 2, B[0],
           B[n - 1]);
  }
}
