#include <bits/stdc++.h>
using namespace std;
int vis[10005];
struct node {
  int m;
  int w;
};
bool cmp(struct node &a, struct node &b) { return a.m < b.m; }
int main() {
  int n;
  while (cin >> n) {
    struct node z[1005];
    memset(vis, 0, sizeof(vis));
    for (int i = 0; i < n; i++) {
      cin >> z[i].m;
      z[i].w = i;
      vis[z[i].m]++;
    }
    sort(z, z + n, cmp);
    int g = (z[0].m + z[n - 1].m);
    if (g % 2 == 0) {
      if (z[0].m == z[n - 1].m) {
        if (vis[g / 2] == n) {
          cout << "Exemplary pages." << endl;
        }
      } else {
        if (vis[g / 2] == n - 2) {
          cout << (z[n - 1].m - z[0].m) / 2 << " ml. from cup #" << z[0].w + 1
               << " to cup #" << z[n - 1].w + 1 << "." << endl;
        } else {
          cout << "Unrecoverable configuration." << endl;
        }
      }
    } else {
      cout << "Unrecoverable configuration." << endl;
    }
  }
}
