#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int, int> A, pair<int, int> B) { return A.first > B.first; }
int main() {
  int n;
  cin >> n;
  long long sum = 0;
  int a[1005];
  vector<pair<int, int>> v_in, v_io;
  vector<pair<int, pair<int, int>>> b;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    sum += a[i];
  }
  sum /= n;
  if (sum * 1.0 / n != (int)sum * 1.0 / n) {
    cout << "Unrecoverable configuration." << endl;
    exit(0);
  }
  long long num = sum;
  bool flag = true;
  for (int i = 0; i < n; i++) {
    if (a[i] > num)
      v_in.push_back(make_pair(a[i] - num, i)), flag = false;
    else if (a[i] < num)
      v_io.push_back(make_pair(num - a[i], i)), flag = false;
  }
  if (flag) {
    cout << "Exemplary pages." << endl;
    exit(0);
  }
  sort(v_in.begin(), v_in.end(), cmp);
  sort(v_io.begin(), v_io.end(), cmp);
  if (v_in.size() != v_io.size() || v_in.size() >= 2) {
    cout << "Unrecoverable configuration." << endl;
    exit(0);
  }
  flag = true;
  for (int i = 0; i < v_in.size(); i++) {
    if (v_in[i].first != v_io[i].first) {
      flag = false;
      break;
    }
    b.push_back(
        make_pair(v_in[i].first, make_pair(v_in[i].second, v_io[i].second)));
  }
  if (!flag) {
    cout << "Unrecoverable configuration." << endl;
  } else {
    for (int i = 0; i < b.size(); i++)
      printf("%d ml. from cup #%d to cup #%d.\n", b[i].first,
             b[i].second.second + 1, b[i].second.first + 1);
  }
}
