#include <bits/stdc++.h>
using namespace std;
int n, resx, resy, a[20000];
vector<int> b;
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
    b.push_back(a[i]);
  }
  int q = a[0], ok = 1;
  for (int i = 1; i < n; ++i) {
    if (q != a[i]) ok = 0;
  }
  if (ok) {
    puts("Exemplary pages.");
    return 0;
  }
  int res = -1;
  if (n == 2) {
    resx = 1;
    resy = 2;
    if (a[0] < a[1]) swap(a[0], a[1]), swap(resx, resy);
    if ((a[0] + a[1]) % 2 == 0) {
      printf("%d ml. from cup #%d to cup #%d.\n", a[0] - ((a[0] + a[1]) / 2),
             resy, resx);
      return 0;
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < n; ++j) {
      for (int l = 0; l < n; ++l) {
        if (a[i] > a[j] && a[j] != a[l] && a[l] != a[i]) {
          if (a[i] + a[j] == a[l] + a[l]) {
            if ((a[i] - a[j]) % 2 == 0) {
              res = (a[i] - a[j]) / 2;
              resx = i + 1;
              resy = j + 1;
              break;
            }
          }
          break;
        }
      }
    }
  }
  if (res < 0) {
    puts("Unrecoverable configuration.");
    return 0;
  }
  a[resx - 1] -= res;
  a[resy - 1] += res;
  ok = 1;
  q = a[0];
  for (int i = 1; i < n; ++i) {
    if (q != a[i]) ok = 0;
  }
  if (!ok) {
    puts("Unrecoverable configuration.");
    return 0;
  }
  printf("%d ml. from cup #%d to cup #%d.\n", res, resy, resx);
  return 0;
}
