#include <bits/stdc++.h>
using namespace std;
int main() {
  int i, n, t, cas = 1, a[1005], from, to, min, max, flag;
  while (scanf("%d", &n) == 1) {
    min = 999999;
    max = 0;
    for ((i) = 0; (i) < (n); (i)++) {
      scanf("%d", &a[i]);
      if (a[i] > max) {
        max = a[i];
        to = i + 1;
      }
      if (min > a[i]) {
        min = a[i];
        from = i + 1;
      }
    }
    if (min == max) {
      printf("Exemplary pages.\n");
      continue;
    }
    t = (max + min) / 2;
    sort(a, a + n);
    flag = 0;
    for (i = 1; i < n - 1; i++) {
      if (t != a[i]) flag = 1;
    }
    if ((max + min) % 2 == 1) flag = 1;
    if (flag == 0)
      printf("%d ml. from cup #%d to cup #%d.\n", max - t, from, to);
    else
      printf("Unrecoverable configuration.\n");
  }
  return 0;
}
