#include <bits/stdc++.h>
using namespace std;
int avg;
string solve(vector<int> v) {
  int N = v.size();
  if (avg % N != 0) return "Unrecoverable configuration.";
  avg /= N;
  bool flag = true;
  int count = 0;
  int index = -1;
  for (int i = 0; i < N; i++) {
    if (avg != v[i]) {
      if (flag) index = i;
      flag = false;
      count++;
    }
  }
  if (flag) return "Exemplary pages.";
  if (count > 2 || count % 2 == 1) return "Unrecoverable configuration.";
  vector<int>::iterator it = find(v.begin(), v.end(), 2 * avg - v[index]);
  if (it != v.end()) {
    int vol = abs(avg - v[index]);
    int a = index;
    int b = (int)(it - v.begin());
    if (v[a] > v[b]) {
      int temp = a;
      a = b;
      b = temp;
    }
    stringstream s;
    s << vol << " ml. from cup #" << (a + 1) << " to cup #" << (b + 1) << ".";
    return s.str();
  }
}
int main(int argc, char* argv[]) {
  int N;
  cin >> N;
  avg = 0;
  vector<int> v(N);
  for (int i = 0; i < N; i++) {
    cin >> v[i];
    avg += v[i];
  }
  cout << solve(v) << endl;
  return 0;
}
