#include <bits/stdc++.h>
using namespace std;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 2 * 1000 * 1000 * 1000;
const int MAXN = 8000000;
int n;
pair<int, int> a[2000];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i].first);
    a[i].second = i;
  }
  sort(a + 1, a + 1 + n);
  if (n == 1) {
    cout << "Exemplary pages.";
    return 0;
  }
  if (n == 2) {
    if (a[1].first < a[2].first)
      if ((a[2].first + a[1].first) % 2 == 0)
        cout << (a[2].first - (a[2].first + a[1].first) / 2)
             << " ml. from cup #" << a[1].second << " to cup #" << a[2].second
             << '.';
      else
        cout << "Unrecoverable configuration.";
    else
      cout << "Exemplary pages.";
    return 0;
  }
  if (a[2].first == a[n - 1].first)
    if (a[1].first < a[2].first)
      if (a[n - 1].first < a[n].first)
        if ((a[n].first + a[1].first) % 2 == 0 &&
            (a[n].first + a[1].first) / 2 == a[2].first)
          cout << (a[n].first - (a[n].first + a[1].first) / 2)
               << " ml. from cup #" << a[1].second << " to cup #" << a[n].second
               << '.';
        else
          cout << "Unrecoverable configuration.";
      else
        cout << "Unrecoverable configuration.";
    else if (a[n - 1].first < a[n].first)
      cout << "Unrecoverable configuration.";
    else
      cout << "Exemplary pages.";
  else
    cout << "Unrecoverable configuration.";
  return 0;
}
