#include <bits/stdc++.h>
using namespace std;
const int maxn = 1001;
int n;
int a[maxn], id[maxn];
void enter() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    id[i] = i;
  }
}
void qsort(int d, int c) {
  int l, r, pivot;
  if (d >= c) return;
  l = d;
  r = c;
  pivot = a[rand() % (c - d + 1) + d];
  while (l <= r) {
    while (a[l] < pivot) l++;
    while (a[r] > pivot) r--;
    if (l <= r) {
      if (l < r) {
        swap(a[l], a[r]);
        swap(id[l], id[r]);
      }
      l++;
      r--;
    }
  }
  qsort(d, r);
  qsort(l, c);
}
void solve() {
  qsort(1, n);
  bool c = false;
  for (int i = 1; i < n; i++)
    if (a[i] != a[i + 1]) c = true;
  if (!c)
    printf("Exemplary pages.\n");
  else {
    if (n == 1)
      printf("Exemplary pages.\n");
    else if (n == 2) {
      if (a[1] == a[2])
        printf("Exemplary pages.\n");
      else if ((abs(a[id[2]] - a[id[1]])) % 2 == 0) {
        int t = (abs(a[id[2]] - a[id[1]])) / 2;
        if (a[id[2]] > a[id[1]])
          printf("%d ml. from cup #1 to cup #2.\n", t);
        else
          printf("%d ml. from cup #2 to cup #1.\n", t);
      } else
        printf("Unrecoverable configuration.\n");
    } else {
      int cnt = 1;
      for (int i = 1; i <= n - 1; i++)
        if (a[i] != a[i + 1]) cnt++;
      if (cnt != 3)
        printf("Unrecoverable configuration.\n");
      else {
        int i1, j1;
        if (a[1] != a[2] && a[n] != a[n - 1]) {
          i1 = 1;
          j1 = n;
        } else if (a[1] != a[2]) {
          i1 = 1;
          j1 = 0;
        } else if (a[n] != a[n - 1]) {
          j1 = n;
          i1 = 0;
        } else {
          i1 = 0;
          j1 = 0;
        }
        for (int i = 2; i <= n - 1; i++)
          if (a[i] != a[i + 1] && a[i] != a[i - 1])
            if (i1 == 0)
              i1 = i;
            else if (j1 == 0) {
              j1 = i;
              break;
            }
        if ((a[j1] - a[i1]) % 2 == 0) {
          int t = (a[j1] - a[i1]) / 2;
          a[i1] += t;
          for (int i = 1; i <= n; i++)
            if (i != i1 && i != j1)
              if (a[i1] == a[i]) {
                printf("%d ml. from cup #%d to cup #%d.\n", t, id[i1], id[j1]);
                break;
              } else {
                printf("Unrecoverable configuration.\n");
                break;
              }
        } else
          printf("Unrecoverable configuration.\n");
      }
    }
  }
}
int main() {
  enter();
  solve();
  return 0;
}
