#include <bits/stdc++.h>
const int maxn = 1e3 + 10;
using namespace std;
struct node {
  int x, id;
} a[maxn];
bool cmp(node q, node w) { return q.x < w.x; }
int main() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i].x, a[i].id = i;
  ;
  sort(a + 1, a + 1 + n, cmp);
  if (a[1].x == a[n].x) {
    puts("Exemplary pages.");
    return 0;
  }
  if ((a[n].x - a[1].x) % 2) {
    puts("Unrecoverable configuration.");
    return 0;
  } else if (n == 2) {
    printf("%d ml. from cup #%d to cup #%d.", (a[2].x - a[1].x) / 2, a[1].id,
           a[2].id);
    return 0;
  }
  int t = (a[1].x + a[n].x) / 2;
  if (t != a[2].x || t != a[n - 1].x) {
    puts("Unrecoverable configuration.");
    return 0;
  } else {
    printf("%d ml. from cup #%d to cup #%d.\n", (a[n].x - a[1].x) / 2, a[1].id,
           a[n].id);
    return 0;
  }
  return 0;
}
