#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
vector<char> merge(vector<char> a, vector<char> b) {
  vector<char> res;
  long long i = 0;
  long long j = 0;
  while (i < a.size() && j < b.size()) {
    if (a[i] <= b[j])
      res.push_back(a[i++]);
    else
      res.push_back(b[j++]);
  }
  while (i < a.size()) res.push_back(a[i++]);
  while (j < b.size()) res.push_back(b[j++]);
  return res;
}
vector<char> solve(vector<char> a) {
  if (a.size() <= 1) return a;
  long long k = a.size() / 2;
  return merge(solve(vector<char>(a.begin(), a.begin() + k)),
               solve(vector<char>(a.begin() + k, a.end())));
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  long long sum = 0;
  vector<long long> a(n);
  for (long long i = 0; i < n; ++i) {
    cin >> a[i];
    sum += a[i];
  }
  long long must = sum / n;
  long long bol = -1;
  long long cnt_bol = 0;
  long long men = -1;
  long long cnt_men = 0;
  for (long long i = 0; i < n; ++i) {
    if (a[i] > must) {
      bol = i + 1;
      cnt_bol++;
    }
    if (a[i] < must) {
      men = i + 1;
      cnt_men++;
    }
  }
  long long dmfhklasdjfklsdjfsdkfjsdkfjksdfjs = a[bol - 1] - a[men - 1];
  if (cnt_bol == 1 && cnt_men == 1) {
    if ((dmfhklasdjfklsdjfsdkfjsdkfjksdfjs) % 2 != 0) {
      cout << "Unrecoverable configuration.";
      return 0;
    }
    a[bol - 1] -= dmfhklasdjfklsdjfsdkfjsdkfjksdfjs / 2;
    if (a[bol - 1] != must) {
      cout << "Unrecoverable configuration.";
      return 0;
    }
    a[men - 1] += dmfhklasdjfklsdjfsdkfjsdkfjksdfjs / 2;
    if (a[men - 1] != must) {
      cout << "Unrecoverable configuration.";
      return 0;
    }
    cout << (dmfhklasdjfklsdjfsdkfjsdkfjksdfjs) / 2 << " ml. from cup #" << men
         << " to cup #" << bol << ".";
    return 0;
  }
  if (cnt_men == 0 && cnt_bol == 0) {
    cout << "Exemplary pages.";
    return 0;
  }
  cout << "Unrecoverable configuration.";
  return 0;
}
