#include <bits/stdc++.h>
using namespace std;
const int MAX = 1200;
int a[MAX], n;
void doit();
int main() {
  while (scanf("%d", &n) == 1) {
    for (int i = 0; i < n; i++) scanf("%d", &a[i]);
    doit();
  }
  return 0;
}
inline void doit() {
  int s = 0;
  int ret;
  int idx1 = -1, idx2 = -1;
  for (int i = 0; i < n; i++) s += a[i];
  if (s % n) {
    puts("Unrecoverable configuration.");
    return;
  }
  ret = s / n;
  for (int i = 0; i < n; i++) {
    if (a[i] > ret) {
      if (idx1 != -1) {
        puts("Unrecoverable configuration.");
        return;
      } else
        idx1 = i + 1;
    } else if (a[i] < ret) {
      if (idx2 != -1) {
        puts("Unrecoverable configuration.");
        return;
      } else
        idx2 = i + 1;
    }
  }
  if (idx1 == -1)
    puts("Exemplary pages.");
  else
    printf("%d ml. from cup #%d to cup #%d.\n", a[idx1 - 1] - ret, idx2, idx1);
}
