#include <bits/stdc++.h>
using namespace std;
int main() {
  int sum = 0, n;
  int arr[10001];
  double sm = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    sm += arr[i];
  }
  sm = sm / n;
  sum = sm;
  if (sum == sm) {
    int *mi = min_element(arr, arr + n);
    int *ma = max_element(arr, arr + n);
    int dif = *ma - sum;
    int a, j;
    if (*mi == *ma) {
      cout << "Exemplary pages.";
      return 0;
    }
    for (int i = 0; i < n; i++) {
      if (arr[i] == *ma) a = i + 1;
      if (arr[i] == *mi) j = i + 1;
    }
    *ma -= dif;
    *mi += dif;
    if (*min_element(arr, arr + n) == *max_element(arr, arr + n))
      cout << dif << " ml. from cup #" << j << " to cup #" << a << ".";
    else
      cout << "Unrecoverable configuration.";
  } else
    cout << "Unrecoverable configuration." << endl;
  return 0;
}
