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