#include <bits/stdc++.h>
using namespace std;
int t, n, m, cas;
const int maxl = 1007;
struct p {
  int v, pos;
} d[maxl];
bool cmp(const p a, const p b) { return a.v < b.v; }
int main(void) {
  while (scanf("%d", &n) == 1) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &d[i].v);
      d[i].pos = i;
    }
    sort(d, d + n, cmp);
    int fiz = -1;
    int cnt;
    if (n == 1)
      fiz = 1;
    else if (n == 2) {
      if (d[0].v == d[1].v)
        fiz = 1;
      else {
        int sum = d[0].v + d[1].v;
        if (sum % 2)
          fiz = -1;
        else {
          cnt = sum / 2;
          fiz = 2;
        }
      }
    } else {
      cnt = d[1].v;
      if (d[n - 1].v + d[0].v == 2 * cnt) fiz = 2;
      if (d[0].v == d[n - 1].v) fiz = 1;
      for (int i = 1; i <= n - 2; i++)
        if (d[i].v != cnt) {
          fiz = -1;
          break;
        }
    }
    if (fiz == -1)
      puts("Unrecoverable configuration.");
    else if (fiz == 1)
      puts("Exemplary pages.");
    else if (fiz == 2)
      printf("%d ml. from cup #%d to cup #%d.\n", d[n - 1].v - cnt,
             d[0].pos + 1, d[n - 1].pos + 1);
  }
  return 0;
}
