#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  int arr[1001], arr1[1001], first = 0, second = 0;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    arr1[i] = arr[i];
  }
  sort(arr1, arr1 + n);
  if (arr1[n - 1] - arr1[0] == 0) {
    cout << "Exemplary pages.";
    return 0;
  }
  for (int i = 0; i < n; i++) {
    if (arr[i] == arr1[0]) {
      first = i;
    }
    if (arr[i] == arr1[n - 1]) {
      second = i;
    }
  }
  int c = (arr1[n - 1] - arr1[0]) / 2;
  arr1[0] += c;
  arr1[n - 1] -= c;
  sort(arr1, arr1 + n);
  if (arr1[n - 1] - arr1[0] != 0) {
    cout << "Unrecoverable configuration.";
    return 0;
  }
  if (arr[second] > arr[first]) {
    cout << c << " ml. from cup #" << first + 1 << " to cup #" << second + 1
         << ".";
  } else {
    cout << c << " ml. from cup #" << second + 1 << " to cup #" << first + 1
         << ".";
  }
  return 0;
}
