#include <bits/stdc++.h>
using namespace std;
long long a[100005], b[100005];
double d[100005];
int main() {
  int n, i, j, k, c = 0, l, s = 0, maxx = 0, minn = 100000, t = 0;
  cin >> n;
  for (i = 0; i < n; i++) {
    cin >> a[i];
    s += a[i];
  }
  if (s % n == 0)
    s = s / n;
  else
    s = -1;
  for (i = 0; i < n; i++) {
    if (s == a[i])
      ++c;
    else {
      if (a[i] > maxx) maxx = a[i];
      if (a[i] < minn) minn = a[i];
      ++t;
    }
  }
  if (c == n) {
    cout << "Exemplary pages." << endl;
    return 0;
  }
  k = maxx + minn;
  k /= 2;
  c += t;
  if (k == s && c == n) {
    c = 0;
    for (i = 0; i < n; i++) {
      if (a[i] == minn) {
        ++c;
        j = i + 1;
      }
      if (a[i] == maxx) {
        ++c;
        k = i + 1;
      }
    }
    if (c == 2) {
      if (a[j - 1] < a[k - 1])
        cout << (a[k - 1] - a[j - 1]) / 2 << " ml. from cup #" << j
             << " to cup #" << k << "." << endl;
      else
        cout << (a[j - 1] - a[k - 1]) / 2 << " ml. from cup #" << k
             << " to cup #" << j << "." << endl;
      return 0;
    }
  }
  cout << "Unrecoverable configuration." << endl;
}
