#include <bits/stdc++.h>
using namespace std;
map<int, int> re;
vector<pair<int, int> > l;
int main() {
  int a;
  cin >> a;
  int zz = 0;
  for (int g = 0; g < a; g++) {
    int r;
    cin >> r;
    l.push_back(pair<int, int>(r, g + 1));
    if (!re[r]) zz++;
    re[r]++;
  }
  if (zz == 1) {
    cout << "Exemplary pages.";
    return 0;
  }
  sort(l.begin(), l.end());
  for (int g = 0; g < l.size(); g++) {
    for (int y = g + 1; y < l.size(); y++) {
      if ((l[g].first + l[y].first) % 2 == 1) continue;
      int m = (l[g].first + l[y].first) / 2;
      if (l[g].first == l[y].first) continue;
      if (re[m] == a - 2) {
        cout << l[y].first - m << " ml. from cup #" << l[g].second
             << " to cup #" << l[y].second << '.';
        return 0;
      }
    }
  }
  cout << "Unrecoverable configuration.";
  return 0;
}
