#include <bits/stdc++.h>
using namespace std;
int a[1002], b[1002], n;
int main() {
  int i, min, max, t, minind, maxind;
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    cin >> a[i];
    b[i] = a[i];
  }
  sort(a, a + n);
  min = a[0];
  max = a[n - 1];
  for (i = 0; i < n; i++) {
    if (b[i] == min) {
      minind = i;
    }
    if (b[i] == max) maxind = i;
  }
  if (min == max)
    cout << "Exemplary pages.";
  else {
    t = (max - min) / 2;
    max -= t, min += t;
    a[0] = min;
    a[n - 1] = max;
    sort(a, a + n);
    if (a[0] == a[n - 1])
      cout << t << " ml. from cup #" << minind + 1 << " to cup #" << maxind + 1
           << ".";
    else
      cout << "Unrecoverable configuration.";
  }
  return 0;
}
