#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 10;
struct node {
  int v;
  int num;
} s[maxn];
int cmp(node a, node b) { return a.v < b.v; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &s[i].v);
    s[i].num = i + 1;
  }
  sort(s, s + n, cmp);
  if (s[0].v == s[n - 1].v) {
    printf("Exemplary pages.\n");
    return 0;
  } else if ((s[n - 1].v - s[0].v) % 2 != 0) {
    printf("Unrecoverable configuration.\n");
    return 0;
  } else {
    int pos = s[n - 1].v - s[0].v;
    pos = pos / 2;
    s[n - 1].v -= pos;
    s[0].v += pos;
    int flag = 0;
    for (int i = 1; i < n - 1; i++)
      if (s[i].v != s[i - 1].v) {
        flag = 1;
        break;
      }
    if (flag == 0)
      printf("%d ml. from cup #%d to cup #%d.\n", pos, s[0].num, s[n - 1].num);
    else
      printf("Unrecoverable configuration.\n");
  }
}
