#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long pi = 3.1415926536;
long long powerM(long long x, long long y, long long M = mod) {
  long long v = 1;
  x = x % M;
  while (y > 0) {
    if (y & 1) v = (v * x) % M;
    y = y >> 1;
    x = (x * x) % M;
  }
  return v;
}
long long power(long long x, long long y) {
  long long v = 1;
  while (y > 0) {
    if (y & 1) v = v * x;
    y = y >> 1;
    x = x * x;
  }
  return v;
}
void solve() {}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  long long a[n];
  long long sum = 0;
  long long mi = INT_MAX, mx = INT_MIN, miid, mxid;
  unordered_map<long long, long long> mmp;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    sum += a[i];
    mmp[a[i]] += 1;
    if (mi > a[i]) {
      mi = a[i];
      miid = i;
    }
    if (mx < a[i]) {
      mx = a[i];
      mxid = i;
    }
  }
  double ele = sum / n;
  if (mi == mx)
    cout << "Exemplary pages." << endl;
  else if (sum % n != 0 || mmp[sum / n] != n - 2)
    cout << "Unrecoverable configuration." << endl;
  else if (ele - mi == mx - ele)
    cout << ele - mi << " ml. from cup #" << miid + 1 << " to cup #" << mxid + 1
         << "." << endl;
  return (0);
}
