#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int* a = new int[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  int* max_e = max_element(a, a + n);
  int* min_e = min_element(a, a + n);
  if (max_e == min_e) {
    cout << "Exemplary pages." << endl;
    return 0;
  }
  if (((*max_e) + (*min_e)) % 2) {
    cout << "Unrecoverable configuration." << endl;
    return 0;
  }
  bool key = true;
  for (int i = 0; i < n; i++) {
    if (a + i != max_e && a + i != min_e) {
      key = !(int((*max_e) + (*min_e)) / 2 != a[i]);
    }
    if (!key) break;
  }
  if (key) {
    cout << int((*max_e) - (*min_e)) / 2;
    cout << " ml. from cup #";
    cout << min_e - a + 1;
    cout << " to cup #";
    cout << max_e - a + 1;
    cout << "." << endl;
  } else
    cout << "Unrecoverable configuration." << endl;
  delete[] a;
  return 0;
}
