#include <bits/stdc++.h>
using namespace std;
const long long N = 1e12 + 0;
const int nol = 0;
long long n, a, cnt, ans, sum;
deque<pair<long long, long long> > pr;
void vkoshp() {
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a;
    cnt += a;
    pr.push_back({a, i + 1});
  }
  sort(pr.begin(), pr.end());
  if (cnt % n != 0) {
    cout << "Unrecoverable configuration." << endl;
    return;
  }
  cnt /= n;
  for (long long i = 0; i < n; i++) {
    if (cnt != pr[i].first) ans++;
  }
  if (ans != 2 and ans != 0) {
    cout << "Unrecoverable configuration." << endl;
    return;
  }
  if (ans == 0) {
    cout << "Exemplary pages." << endl;
    return;
  }
  ans = pr[pr.size() - 1].first - pr[0].first;
  ans /= 2;
  cout << ans << " ml. from cup #" << pr[0].second << " to cup #"
       << pr[pr.size() - 1].second << "." << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  while (t--) vkoshp();
}
