#include <bits/stdc++.h>
using namespace std;
struct Juice {
  int vol;
  int order;
};
int compare(Juice a, Juice b) { return a.vol < b.vol; }
int main() {
  int n;
  Juice a[1005];
  int sum;
  while (scanf("%d", &n) != EOF) {
    sum = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i].vol);
      a[i].order = i;
      sum += a[i].vol;
    }
    int average = sum / n;
    sort(a + 1, a + n + 1, compare);
    int i = 1;
    int Num1 = 0;
    while (a[i].vol < average && i <= n) {
      Num1++;
      i++;
    }
    i = n;
    int Num2 = 0;
    while (a[i].vol > average && i >= 1) {
      Num2++;
      i--;
    }
    if (Num2 == 0 && Num1 == 0)
      printf("Exemplary pages.\n");
    else if (Num2 == 1 && Num1 == 1 && average - a[1].vol == a[n].vol - average)
      printf("%d ml. from cup #%d to cup #%d.\n", (a[n].vol - a[1].vol) / 2,
             a[1].order, a[n].order);
    else
      printf("Unrecoverable configuration.\n");
  }
  return 0;
}
